Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics.
Amir AbboudKarl BringmannNick FischerPublished in: CoRR (2022)
Keyphrases
- lower bound
- objective function
- distance computation
- upper bound
- lower bounding
- exact solution
- min sum
- distance measure
- branch and bound algorithm
- exact and approximate
- active learning
- lower and upper bounds
- concept class
- distance function
- euclidean distance
- distance metric
- optimal solution
- upper and lower bounds
- graph theory
- branch and bound
- test cases
- vc dimension
- similarity search
- linear programming
- np hard
- optimal cost
- linear functions
- randomly generated problems
- training set
- provide an upper bound