An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem

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.