William D. Hinsberg, Gregory M. Wallraff, et al.
JM3
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
Jalal Mahmud, Michelle X. Zhou, et al.
IUI 2013
Conference paper
Strategic classification
Moritz Hardt, Nimrod Megiddo, et al.
ITCS 2016
Masakazu Kojima, Nimrod Megiddo, et al.
Mathematical Programming