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.
Cite
CITATION STYLE
APA
Megiddo, N. (1989). On the ball spanned by balls. Discrete & Computational Geometry, 4(1), 605–610. https://doi.org/10.1007/BF02187750
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free