Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants.

Daniel Mölle Stefan Richter Peter Rossmanith

Published in: COCOON (2006)

Keyphrases

vertex cover
approximation algorithms
worst case
upper bound
partial order
lower bound
planar graphs
precedence constraints
error bounds
constant factor
polynomial time approximation
upper and lower bounds
optimality criterion
lower and upper bounds
branch and bound
special case
partially ordered
search algorithm