Abstract
In this paper we present efficient approximation algorithms for the distance selection problem. Our technique is based on the well-separated pair decomposition proposed in [8].
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received May 16, 1999; revised June 5, 2001.
Rights and permissions
About this article
Cite this article
Bespamyatnikh, S., Segal, M. Fast Algorithms for Approximating Distances. Algorithmica 33, 263–269 (2002). https://doi.org/10.1007/s00453-001-0114-7
Issue Date:
DOI: https://doi.org/10.1007/s00453-001-0114-7