%0 Journal Article
%J Information and Computation
%D 1995
%T A simple randomized sieve algorithm for the closest-pair problem
%A Khuller, Samir
%A Matias,Y.
%X We present a linear time randomized sieve algorithm for the closest-pair problem. Thealgorithm as well as its analysis are simple. The algorithm is extended to obtain a randomized linear time approximation algorithm for the closest bichromatic pair problem.
%B Information and Computation
%V 118
%P 34 - 37
%8 1995///
%G eng
%N 1