
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
View/ Open
Type
Document de travail / Working paperDate
2007Series title
Cahiers du LamsadeSeries number
262Metadata
Show full item recordAbstract (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 / Keywords
connected vertex cover; chordal graphs; bipartite graphs; planar graphs; hypergraphs; APX-complete; approximation algorithmRelated items
Showing items related by title and author.
-
Monnot, Jérôme; Gourvès, Laurent; Escoffier, Bruno (2010) Article accepté pour publication ou publié
-
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme (2007) Communication / Conférence
-
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme (2017) Article accepté pour publication ou publié
-
Escoffier, Bruno; Demange, Marc; Paschos, Vangelis; de Werra, Dominique; Monnot, Jérôme (2008) Chapitre d'ouvrage
-
Monnot, Jérôme; Gourvès, Laurent; Escoffier, Bruno (2010) Communication / Conférence