A Round and Bipartize Approximation Algorithm for Vertex Cover.

Danish Kashaev Guido Schäfer

Published in: CoRR (2022)

Keyphrases

vertex cover
polynomial time approximation
learning algorithm
approximation algorithms
computational complexity
closed form
np hard
dynamic programming
objective function
optimal solution
search space
knapsack problem
worst case
approximation ratio