Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee.

Shivam Garg Geevarghese Philip

Published in: CoRR (2015)

Keyphrases

vertex cover
approximation algorithms
partial order
planar graphs
precedence constraints
np hard
optimality criterion
scheduling problem
parameter estimation
polynomial time approximation