Work

Finding the Farthest in High Dimensions: Dynamic Diameter and Farthest-Neighbor Search

Year: 2026
Type: preprint
Abstract: We give faster algorithms for diameter and farthest-neighbor search in high-dimensional Euclidean space. For every fixed $1
Language: English
Open Access status: green
OpenAlex ID: W7226008361
Cites: 4
Cited by:
Related to: 10