455 search results - page 3 / 91 » Approximation Algorithms for Partial Covering Problems |
DC
2011
12 years 10 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
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 ...
SIAMCOMP
1998
13 years 10 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...