Finding the Farthest in High Dimensions: Dynamic Diameter and Farthest-Neighbor Search
cs.DS
Submitted: 2026-11-12
Updated: 2026-11-17
Code: https://github.com/hajiaghayi/Diameter-Alg1
Terminology
Sources
- Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
- An Equivalence Class for Orthogonal Vectors
- A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time