Kernelization of the 3-path vertex cover problem.

Christoph Brause Ingo Schiermeyer

Published in: Discret. Math. (2016)

Keyphrases

vertex cover
approximation algorithms
partial order
shortest path
precedence constraints
planar graphs
optimality criterion
minimum cost
special case
objective function
lower bound
probabilistic model
simulated annealing
parameter estimation
information theoretic
single machine scheduling problem