Minimum k-path vertex cover.

Bostjan Bresar Frantisek Kardos Ján Katrenic Gabriel Semanisin

Published in: Discret. Appl. Math. (2011)

Keyphrases

vertex cover
approximation algorithms
minimum cost
precedence constraints
partial order
planar graphs
constant factor
special case
np hard
shortest path
optimality criterion
worst case
spanning tree
lower bound
polynomial time approximation