Jalal Mahmud, Michelle X. Zhou, et al.
IUI 2013
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
Adaptive traitor tracing for large anonymous attack
Hongxia Jin, Jeffery Lotspiech, et al.
CCS 2008
Miklos Ajtai, Nimrod Megiddo
STOC 1992
Shinji Mizuno, Nimrod Megiddo, et al.
Journal of Complexity