Sciweavers

Share
WG
2007
Springer

Complexity and Approximation Results for the Connected Vertex Cover Problem

9 years 10 days ago
Complexity and Approximation Results for the Connected Vertex Cover Problem
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal graphs, has a PTAS in planar graphs, is APX-hard in bipartite graphs and is 5/3-approximable in any class of graphs where the vertex cover problem is polynomial (in particular in bipartite graphs).
Bruno Escoffier, Laurent Gourvès, Jé
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where WG
Authors Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Comments (0)
books