Login / Signup
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon.
Jonas Holmerin
Published in:
STOC (2002)
Keyphrases
</>
vertex cover
planar graphs
approximation algorithms
partial order
np hard
precedence constraints
graph theory
undirected graph
optimality criterion
piecewise linear
polynomial time approximation
partially ordered
approximation ratio