Above guarantee parameterization for vertex cover on graphs with maximum degree 4.

Published in: J. Comb. Optim. (2023)

Keyphrases

vertex cover
planar graphs
approximation algorithms
partial order
undirected graph
approximation guarantees
precedence constraints
np hard
special case
bipartite graph
branch and bound algorithm
graph theory
graph structure
log likelihood
optimality criterion