Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem)

From Algorithm Wiki

Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Khuller,_Matias_(k-dimensional_space,_Euclidean_metric_Closest_Pair_Problem)&oldid=45086"