A randomized polynomial kernelization for Vertex Cover with a smaller parameter.

Published in: CoRR (2016)

Keyphrases

vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
optimality criterion
computational complexity
polynomial time approximation
np hard
worst case
maximum likelihood
closed form
complex networks