On the weighted k-path vertex cover problem.

Bostjan Bresar Rastislav Krivos-Bellus Gabriel Semanisin Priomoz Sparl

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

Keyphrases

vertex cover
approximation algorithms
partial order
precedence constraints
planar graphs
shortest path
minimum cost
polynomial time approximation
search algorithm
np hard
probabilistic model