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).

• Type: Conference
• Year: 2007
• Where: WG
• Authors: Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
• Keywords: Bipartite Graphs, Computer Science, Vertex Cover, Vertex Cover Problem, WG 2007