Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions d≥4.
Egor GorbachevMarvin KünnemannPublished in: CoRR (2023)
Keyphrases
- related problems
- lower bound
- simplex method
- upper bound
- broadly applicable
- range searching
- branch and bound
- similarity measure
- objective function
- linear programming
- distance measure
- stable marriage
- np hard
- optimal solution
- lower and upper bounds
- structured databases
- image processing
- branch and bound algorithm
- constraint satisfaction problems
- worst case