Year: 2026
Type: preprint
Abstract: We give faster algorithms for diameter and farthest-neighbor search in high-dimensional Euclidean space. For every fixed $1
Source: arXiv (Cornell University)
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7226008361
