A tight (non-combinatorial) conditional lower bound for Klee's Measure Problem in 3D.

Marvin Künnemann

Published in: FOCS (2022)

Keyphrases

lower bound
upper bound
simplex method
branch and bound algorithm
np hard
worst case
branch and bound
similarity measure
lower and upper bounds
objective function
optimal solution
linear programming
special case
distance measure
reinforcement learning
scheduling problem