5 search results - page 1 / 1 » Primal-Dual Schema for Capacitated Covering Problems |
IPCO
2008
14 years 13 days ago
2008
SIAMCOMP
2008
13 years 11 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
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...
APPROX
2005
Springer
14 years 4 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...
RANDOM
2001
Springer
14 years 3 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...