Tibor Hegedus, Nimrod Megiddo
Discrete Applied 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
Edith Cohen, Nimrod Megiddo
Mathematical Programming
Masakazu Kojima, Nimrod Megiddo, et al.
Operations Research Letters
Nimrod Megiddo
Information Processing Letters