Minimum k-path vertex cover

Bostjan Bresar Frantisek Kardos Ján Katrenic Gabriel Semanisin

Published in: CoRR (2010)

Keyphrases

vertex cover
approximation algorithms
minimum cost
partial order
precedence constraints
constant factor
planar graphs
special case
scheduling problem
spanning tree
np hard
objective function
log likelihood
optimality criterion
polynomial time approximation