Login / Signup
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:
J. ACM (2021)
Keyphrases
</>
lower bound
upper bound
worst case
randomly generated problems
online learning
branch and bound
embedded systems
graph mining
social networks
objective function
data structure
optimization problems
decision problems
branch and bound algorithm
graph theory
min sum