Login / Signup
Iterative Partial Rounding for Vertex Cover with Hard Capacities.
Mong-Jen Kao
Published in:
SODA (2017)
Keyphrases
</>
vertex cover
approximation algorithms
np hard
special case
minimum cost
worst case
precedence constraints
partial order
branch and bound algorithm
planar graphs
undirected graph