Login / Signup

Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover.

Naomi NishimuraPrabhakar RagdeDimitrios M. Thilikos
Published in: WADS (2001)
Keyphrases
  • vertex cover
  • computational complexity
  • optimization problems
  • learning algorithm
  • approximation algorithms
  • np hard
  • planar graphs