Nimrod Megiddo
Information Processing Letters
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
Shinji Mizuno, Nimrod Megiddo, et al.
Journal of Complexity
Tomás Feder, Nimrod Megiddo, et al.
Theoretical Computer Science
Nimrod Megiddo
Journal of Algorithms