Daphne Koller, Nimrod Megiddo
International Journal of Game Theory
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
Fast algorithms for finding randomized strategies in game trees
Daphne Keller, Nimrod Megiddo, et al.
STOC 1994
Nimrod Megiddo
Discrete and Computational Geometry
Daphne Koller, Nimrod Megiddo, et al.
Games and Economic Behavior