Approximating Vertex Cover using Structural Rounding.

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

Published in: ALENEX (2020)

Keyphrases

vertex cover
approximation algorithms
np hard
special case
precedence constraints
worst case
minimum cost
partial order
polynomial time approximation
planar graphs
scheduling problem
dynamic programming
undirected graph
optimal solution
upper bound
spanning tree