Ilan Adler, Nimrod Megiddo
Journal of the ACM
Paper
An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
Abstract
A randomizing algorithm for the weighted Euclidean 1-center problem is presented. The algorithm is shown to run on any problem in O(nlogn) time with high probability. © 1986.
Related
Edith Cohen, Nimrod Megiddo
Algorithmica
Conference paper
Dynamic faceted search for discovery-driven analysis
Debabrata Dash, Jun Rao, et al.
CIKM 2008
Daphne Koller, Nimrod Megiddo
Games and Economic Behavior