Login / Signup

Vertex Cover Problem Parameterized Above and Below Tight Bounds.

Gregory Z. GutinEun Jung KimMichael LampisValia Mitsou
Published in: Theory Comput. Syst. (2011)
Keyphrases
  • tight bounds
  • vertex cover
  • approximation algorithms
  • upper bound
  • partial order
  • planar graphs
  • precedence constraints
  • worst case
  • optimality criterion
  • lower bound
  • branch and bound algorithm
  • special case
  • np hard