Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics.
Amir AbboudKarl BringmannNick FischerPublished in: STOC (2023)
Keyphrases
- lower bound
- objective function
- upper bound
- distance computation
- exact solution
- min sum
- branch and bound algorithm
- lower bounding
- distance measure
- absolute difference
- exact and approximate
- graph theory
- worst case
- lower and upper bounds
- concept class
- distance function
- tree edit distance
- optimal cost
- provide an upper bound
- hamming distance
- test cases
- np hard
- kullback leibler divergence
- branch and bound
- euclidean distance
- active learning