Approximating Vertex Cover using Structural Rounding.

Brian Lavallee Hayley Russell Blair D. Sullivan Andrew van der Poel

Published in: CoRR (2019)

Keyphrases

vertex cover
approximation algorithms
np hard
special case
precedence constraints
worst case
minimum cost
partial order
planar graphs
linear programming
optimality criterion