Login / Signup
-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms.
Carl Einarson
Gregory Z. Gutin
Bart M. P. Jansen
Diptapriyo Majumdar
Magnus Wahlström
Published in:
J. Comput. Syst. Sci. (2023)
Keyphrases
</>
vertex cover
approximation algorithms
undirected graph
disjoint paths
minimum cost
special case
np hard
worst case
primal dual
precedence constraints
connected components
approximation ratio
constant factor
polynomial time approximation
planar graphs
edge weights
search algorithm