Approximating vertex cover in dense hypergraphs.

Jean Cardinal Marek Karpinski Richard Schmied Claus Viehmann

Published in: J. Discrete Algorithms (2012)

Keyphrases

vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
optimality criterion
search algorithm
single machine scheduling problem
graph theory