Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem)
Jump to navigation
Jump to search
Time Complexity
infinite (can be upper bounded by $O(n^{2})$)
Space Complexity
$O(n)$ words
(https://www.sciencedirect.com/science/article/pii/S0890540185710498?via%3Dihub)
Description
Approximate?
Exact
Randomized?
Yes, Las Vegas
Model of Computation
Real RAM
Year
1995
Reference
https://www.sciencedirect.com/science/article/pii/S0890540185710498?via%3Dihub