Miklos Ajtai, Nimrod Megiddo
SIAM Journal on Computing
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
Daniela Pucci De Farias, Nimrod Megiddo
Journal of the ACM
Conference paper
Algorithms and complexity analysis for some flow problems
Edith Cohen, Nimrod Megiddo
SODA 1991
Ching-Tien Ho, Rakesh Agrawal, et al.
SIGMOD Record (ACM Special Interest Group on Management of Data)