Peter A. Beling, Nimrod Megiddo
Theoretical Computer Science
Paper
On the ball spanned by balls
Abstract
The procedure for linear programming in linear time in fixed dimension is extended to solve in linear time certain nonlinear problems. Examples are the problem of finding the smallest ball enclosing n given balls, and the weighted-center problem in fixed dimension. © 1989 Springer-Verlag New York Inc.
Related
Joseph O'Rourke, S. Rao Kosaraju, et al.
Discrete and Computational Geometry
Joseph Y Halpern, Nimrod Megiddo, et al.
Journal of Complexity
Conference paper
Fast algorithms for finding randomized strategies in game trees
Daphne Keller, Nimrod Megiddo, et al.
STOC 1994