Approximating Vertex Cover in Dense Hypergraphs

Jean Cardinal Marek Karpinski Richard Schmied Claus Viehmann

Published in: CoRR (2010)

Keyphrases

vertex cover
approximation algorithms
partial order
planar graphs
precedence constraints
optimality criterion
lower bound
np hard
special case
worst case
graph theory
minimum cost
maximum likelihood
log likelihood
single machine scheduling problem