Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme (2007), Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. https://basepub.dauphine.fr/handle/123456789/20728
TypeDocument de travail / Working paper
Series titleCahiers du Lamsade
MetadataShow full item record
Abstract (EN)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). Finally, dealing with hypergraphs, we study the complexity and the approximability of two natural generalizations.
Subjects / Keywordsconnected vertex cover; chordal graphs; bipartite graphs; planar graphs; hypergraphs; APX-complete; approximation algorithm
Showing items related by title and author.
Complexity and Approximation Results for the Connected Vertex Cover Problem in Graphs and Hypergraphs Monnot, Jérôme; Gourvès, Laurent; Escoffier, Bruno (2010) Article accepté pour publication ou publié