Login / Signup
Above guarantee parameterization for vertex cover on graphs with maximum degree 4.
Dekel Tsur
Published in:
CoRR (2018)
Keyphrases
</>
vertex cover
planar graphs
approximation algorithms
approximation guarantees
precedence constraints
undirected graph
partial order
np hard
optimality criterion
directed graph
polynomial time approximation
special case
dynamic programming
scheduling problem
approximation ratio