On kernels for d-path vertex cover.

Radovan Cervený Pratibha Choudhary Ondrej Suchý

Published in: J. Comput. Syst. Sci. (2024)

Keyphrases

vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
minimum cost
log likelihood
shortest path
optimality criterion
feature space
np hard
scheduling problem