On Kernels for d-Path Vertex Cover.

Radovan Cervený Pratibha Choudhary Ondrej Suchý

Published in: CoRR (2021)

Keyphrases

vertex cover
approximation algorithms
partial order
precedence constraints
planar graphs
optimality criterion
feature space
minimum cost
shortest path
learning algorithm
scheduling problem
closed form
worst case
np hard
lower bound
search algorithm
support vector