Vertex Cover Problem Parameterized Above and Below Tight Bounds

Gregory Z. Gutin Eun Jung Kim Michael Lampis Valia Mitsou

Published in: CoRR (2009)

Keyphrases

tight bounds
vertex cover
approximation algorithms
upper bound
partial order
planar graphs
precedence constraints
polynomial time approximation
lower bound
scheduling problem
worst case
global constraints
partially ordered
optimality criterion