Login / Signup

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.

Naomi NishimuraPrabhakar RagdeDimitrios M. Thilikos
Published in: Discret. Appl. Math. (2005)
Keyphrases
  • vertex cover
  • computational problems
  • optimization problems
  • approximation algorithms
  • learning algorithm
  • computational complexity
  • worst case
  • dynamic programming
  • greedy algorithm