Sciweavers

12519 search results - page 140 / 2504
» Approximation Problems Categories
Sort
View
ICALP
2010
Springer
15 years 11 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 3 months ago
Streaming Algorithms for extent problems in high dimensions
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
Pankaj K Agarwal, R. Sharathkumar
ICWS
2009
IEEE
16 years 3 months ago
What are the Problem Makers: Ranking Activities According to their Relevance for Process Changes
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
Chen Li, Manfred Reichert, Andreas Wombacher
SIAMJO
2002
102views more  SIAMJO 2002»
15 years 6 months ago
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U. The robust ...
Aharon Ben-Tal, Arkadi Nemirovski, Cees Roos
COR
2006
82views more  COR 2006»
15 years 6 months ago
Semidefinite programming based approaches to the break minimization problem
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
Ryuhei Miyashiro, Tomomi Matsui