Nimrod Megiddo, Shinji Mizuno, et al.
Mathematical Programming, Series B
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
Ching-Tien Ho, Rakesh Agrawal, et al.
SIGMOD Record (ACM Special Interest Group on Management of Data)
Nimrod Megiddo, Uzi Vishkin
Theoretical Computer Science
Conference paper
ArC: A self-tuning, low overhead replacement cache
Nimrod Megiddo, Dharmendra S. Modha
FAST 2003