Daphne Koller, Nimrod Megiddo
Games and Economic Behavior
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
Ronald Fagin, Joseph Y. Halpern, et al.
Information and Computation
Tibor Hegedus, Nimrod Megiddo
Discrete Applied Mathematics
Anshul Sheopuri, Eitan Zemel
EJOR