1424 search results - page 1 / 285 » The Multi-radius Cover Problem |
ICALP
2001
Springer
14 years 3 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
PODC
2009
ACM
14 years 11 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
COR
2006
13 years 10 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...