Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.

Vincent Cohen-Addad Éric Colin de Verdière Dániel Marx Arnaud de Mesmay

Published in: CoRR (2019)

Keyphrases

lower bound
upper bound
optimization problems
np complete
vc dimension
lower and upper bounds
simulated annealing
branch and bound algorithm
hard problems
cutting stock problems