Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs |
| |
Authors: | Bruno Escoffier Laurent Gourvès Jérôme Monnot |
| |
Institution: | 1. Université de Paris-Dauphine, LAMSADE, F-75775 Paris, France;2. CNRS, FRE 3234, F-75775 Paris, France |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|