Sciweavers

Share
14 search results - page 1 / 3
» Approximation of Partial Capacitated Vertex Cover
Sort
View
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
10 years 1 months ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
10 years 2 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
10 years 1 months ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
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...
Julián Mestre
MST
2007
138views more  MST 2007»
9 years 7 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
9 years 7 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
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...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
books