Edith Cohen, Nimrod Megiddo
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
Conference paper
ArC: A self-tuning, low overhead replacement cache
Nimrod Megiddo, Dharmendra S. Modha
FAST 2003
Masakazu Kojima, Nimrod Megiddo, et al.
Mathematical Programming
Nimrod Megiddo
Mathematical Programming