Iterative Partial Rounding for Vertex Cover with Hard Capacities.

Published in: Algorithmica (2021)

Keyphrases

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