On Kernels for d-Path Vertex Cover.

Radovan Cervený Pratibha Choudhary Ondrej Suchý

Published in: MFCS (2022)

Keyphrases

vertex cover
approximation algorithms
partial order
minimum cost
precedence constraints
planar graphs
support vector
np hard
shortest path
feature space
optimality criterion
polynomial time approximation
log likelihood