Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - ε.

Published in: Computational Complexity Conference (2002)

Keyphrases

vertex cover
planar graphs
approximation algorithms
partial order
graph theory
undirected graph
directed graph
precedence constraints
optimality criterion
approximate inference
minimum weight
np hard
graph structure
long run