Abstract
We present a linear time randomized sieve algorithm for the closest-pair problem. The algorithm and its analysis are simple. The algorithm is extended to obtain a randomized linear time approximation algorithm for the closest bichromatic pair problem.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 34-37 |
| Number of pages | 4 |
| Journal | Information and Computation |
| Volume | 118 |
| Issue number | 1 |
| DOIs | |
| State | Published - Apr 1995 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics