Login / Signup
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs.
Bruno Escoffier
Laurent Gourvès
Jérôme Monnot
Published in:
J. Discrete Algorithms (2010)
Keyphrases
</>
vertex cover
approximation algorithms
planar graphs
worst case
graph theory
polynomial time approximation
error bounds
approximation guarantees
partial order
undirected graph
computational complexity
np hard
approximation ratio
special case
constant factor
minimum cost
space complexity