Ilan Adler, Nimrod Megiddo
Journal of the ACM
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
Discovering Predictive Association Rules
Nimrod Megiddo, Ramakrishnan Srikant
KDD 1998
Nimrod Megiddo
Discrete and Computational Geometry
Nimrod Megiddo, R. Chandrasekaran
Operations Research Letters