What is known about Vertex Cover Kernelization?

Michael R. Fellows Lars Jaffke Aliz Izabella Király Frances A. Rosamond Mathias Weller

Published in: CoRR (2018)

Keyphrases

special case
vertex cover
approximation algorithms
np hard
computational complexity
partial order
planar graphs
precedence constraints
optimality criterion
search algorithm
scheduling problem
simulated annealing
undirected graph