Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs.

Published in: ICALP (2002)

Keyphrases

vertex cover
approximation algorithms
np hard
special case
partial order
precedence constraints
minimum cost
worst case
planar graphs
optimality criterion
undirected graph