Fast algorithms for approximating distances

S. Bespamyatnikh, M. Segal

    Research output: Contribution to journalArticlepeer-review

    9 Scopus citations

    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].

    Original languageEnglish
    Pages (from-to)263-269
    Number of pages7
    JournalAlgorithmica
    Volume33
    Issue number2
    DOIs
    StatePublished - 1 Jan 2002

    Keywords

    • Approximation algorithms
    • Distance selection problem
    • Well-separated pair decomposition

    ASJC Scopus subject areas

    • General Computer Science
    • Computer Science Applications
    • Applied Mathematics

    Fingerprint

    Dive into the research topics of 'Fast algorithms for approximating distances'. Together they form a unique fingerprint.

    Cite this