Round and Bipartize for Vertex Cover Approximation.

Danish Kashaev Guido Schäfer

Published in: APPROX/RANDOM (2023)

Keyphrases

vertex cover
approximation algorithms
polynomial time approximation
approximation ratio
np hard
special case
worst case
minimum cost
partial order
constant factor
search algorithm
upper bound
approximation guarantees