Login / Signup
Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems.
Pasin Manurangsi
Luca Trevisan
Published in:
CoRR (2018)
Keyphrases
</>
vertex cover
related problems
approximation algorithms
integrality gap
np hard
planar graphs
special case
minimum cost
worst case
primal dual
approximation ratio
constant factor
linear programming
precedence constraints
polynomial time approximation
lower bound
approximation guarantees