Masakazu Kojima, Nimrod Megiddo, et al.
Mathematical Programming
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
Masakazu Kojima, Nimrod Megiddo, et al.
Operations Research Letters
Masakazu Kojima, Nimrod Megiddo
Linear Algebra and Its Applications
William D. Hinsberg, Gregory M. Wallraff, et al.
JM3