Miklos Ajtai, Nimrod Megiddo, et al.
SIAM Journal on Discrete Mathematics
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
Nimrod Megiddo, Arie Tamir
Operations Research Letters
Daphne Koller, Nimrod Megiddo
International Journal of Game Theory
Nimrod Megiddo
Journal of Algorithms