Sign in
What Is Known About Vertex Cover Kernelization?
Michael R. Fellows
Lars Jaffke
Aliz Izabella Király
Frances A. Rosamond
Mathias Weller
Published in:
Adventures Between Lower Bounds and Higher Altitudes (2018)
Keyphrases
</>
vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
np hard
polynomial time approximation
worst case
optimality criterion
computational complexity
scheduling problem
theoretical analysis
log likelihood