54 search results - page 1 / 11 » Primal-Dual RNC Approximation Algorithms for Set Cover and C... |
SIAMCOMP
1998
13 years 4 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...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
RANDOM
2001
Springer
13 years 9 months ago
2001
Springer
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...