A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter.

Published in: SIAM J. Discret. Math. (2018)

Keyphrases

vertex cover
approximation algorithms
partial order
planar graphs
optimality criterion
np hard
precedence constraints
pairwise
special case
log likelihood