Concepedia

Randomized Closest Pair Algorithms

Randomized Closest Pair Algorithms is a computational method within randomized geometric algorithms that solves the closest pair problem by employing randomization techniques to achieve efficient expected-time performance in finding the pair of points with minimum distance in a metric space.

25

Publications

1.2K

Citations

57

Authors

49

Institutions

Publications per year

2017–2026

2

Parents

Publications

25

Finding best approximation pairs relative to two closed convex sets in Hilbert spaces

Heinz H. Bauschke, Patrick L. Combettes, D. Lüke · Journal of Approximation Theory · 2004 · 210 citations · Full text

, , +14

A Reliable Randomized Algorithm for the Closest-Pair Problem

Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen et al. · Journal of Algorithms · 1997 · 204 citations

, , +13

Euclidean minimum spanning trees and bichromatic closest pairs

Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf et al. · Discrete & Computational Geometry · 1991 · 153 citations · Full text

, , +14

Iterated nearest neighbors and finding minimal polytopes

David Eppstein, Jeff Erickson · Discrete & Computational Geometry · 1994 · 121 citations · Full text

, , +14

Developments in the theory of randomized shortest paths with a comparison of graph node distances

Ilkka Kivimäki, Masashi Shimbo, Marco Saerens · Physica A Statistical Mechanics and its Applications · 2013 · 77 citations · Full text

, , +13

1–5 of 25

Authors

57

  1. RR
    Rajeev Raman

    University of Leicester, United Kingdom

    3 publications · 38 citations

    3

    h-index

  2. CS
    Christian Schwarz

    Friedrich Schiller University Jena, Germany

    3 publications · 38 citations

    3

    h-index

  3. MJ
    Mordecai J. Golin

    Hong Kong University of Science and Technology, Hong Kong SAR China

    3 publications · 38 citations

    3

    h-index

  4. OS
    Otfried Schwarzkopf

    Utrecht University, Netherlands

    2 publications · 183 citations

    2

    h-index

  5. YG
    Yan Gu

    Qingdao University, China

    2 publications · 60 citations

    2

    h-index

1–5 of 57

Institutions

49

  1. Max Planck Society

    Munich, Germany

    3 h-index

    6 publications

    269 citations

  2. University of California, Berkeley

    Berkeley, United States

    2 h-index

    2 publications

    164 citations

  3. AT&T (United States)

    Bedminster, United States

    2 h-index

    3 publications

    173 citations

  4. Max Planck Institute for Informatics

    Saarbrücken, Germany

    2 h-index

    4 publications

    240 citations

  5. Freie Universität Berlin

    Berlin, Germany

    2 h-index

    4 publications

    366 citations

  6. University of Illinois Urbana-Champaign

    Urbana, United States

    2 h-index

    2 publications

    183 citations

  7. Duke University

    Durham, United States

    2 h-index

    2 publications

    183 citations

  8. Stanford University

    Stanford, United States

    2 h-index

    4 publications

    149 citations

1–8 of 49

Venues

  1. SIAM Journal on Computing

    2 publications · 28 citations

    2

    h-index

  2. Symposium on Discrete Algorithms

    Conference · 2 publications · 43 citations

    2

    h-index

  3. Discrete & Computational Geometry

    2 publications · 274 citations

    2

    h-index

  4. Journal of the ACM

    JACM · 2 publications · 79 citations

    2

    h-index

  5. Discrete Applied Mathematics

    2 publications · 28 citations

    2

    h-index

1–5