Login / Signup

Computing a tree having a small vertex cover.

Takuro FukunagaTakanori Maehara
Published in: Theor. Comput. Sci. (2019)
Keyphrases
  • vertex cover
  • brute force search
  • approximation algorithms
  • tree structure
  • precedence constraints
  • polynomial time approximation
  • np hard
  • dynamic programming
  • optimality criterion