Complexity of the Maximum k-Path Vertex Cover Problem.

Eiji Miyano Toshiki Saitoh Ryuhei Uehara Tsuyoshi Yagita Tom C. van der Zanden

Published in: WALCOM (2018)

Keyphrases

vertex cover
approximation algorithms
worst case
precedence constraints
computational complexity
partial order
planar graphs
shortest path
space complexity
minimum cost