Peter A. Beling, Nimrod Megiddo
Theoretical Computer Science
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.
Peter A. Beling, Nimrod Megiddo
Theoretical Computer Science
Miklos Ajtai, Nimrod Megiddo
SIAM Journal on Computing
Jun Rao, Chun Zhang, et al.
SIGMOD 2002
Edith Cohen, Nimrod Megiddo
Journal of the ACM (JACM)