Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma.

Tomohiro Koana André Nichterlein Niklas Wünsche

Published in: CoRR (2022)

Keyphrases

vertex cover
approximation algorithms
partial order
planar graphs
precedence constraints
optimality criterion
polynomial time approximation
np hard
special case
partially ordered
worst case
probabilistic inference
log likelihood