Refael Hassin, Nimrod Megiddo
Discrete Applied Mathematics
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
Shinji Mizuno, Nimrod Megiddo, et al.
Journal of Complexity
Conference paper
Automating physical database design in a parallel database
Jun Rao, Chun Zhang, et al.
SIGMOD 2002
Conference paper
Strategic classification
Moritz Hardt, Nimrod Megiddo, et al.
ITCS 2016