Login / Signup

On a relation between k-path partition and k-path vertex cover.

Christoph BrauseRastislav Krivos-Bellus
Published in: Discret. Appl. Math. (2017)
Keyphrases
  • vertex cover
  • shortest path
  • approximation algorithms
  • lower bound