Sharp Limits of Graph-Based Nearest Neighbor Search on the Sphere
cs.DS
Submitted: 2026-11-05
Updated: 2026-11-05
Terminology
Sources
- Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
- Graph-Based Nearest-Neighbor Search without the Spread
- Graph-based time-space trade-offs for approximate near neighbors
- A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search
- Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search
- A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph
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