Iterative Partial Rounding for Vertex Cover with Hard Capacities.

Published in: CoRR (2016)

Keyphrases

vertex cover
approximation algorithms
np hard
special case
worst case
precedence constraints
planar graphs
partial order
minimum cost
lower bound