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 enclosingn given balls, and the weighted-center problem in fixed dimension.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
R. Chandrasekaran, The weighted Euclidean 1-center problem,Operations Research Letters 1 (1982), 111–112.
K. Clarkson, Linear programming in\(O(n \times 3^{d^2 } )\) time,Information Processing Letters 22 (1986), 21–24.
R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, in:Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science (1984), IEEE Computer Society Press, Los Angeles, 1984, pp. 255–260.
M. E. Dyer, Linear-time algorithms for two- and three-variable linear programs,SIAM Journal on Computing 13 (1984), 31–45.
M. E. Dyer, On a multidimensional search technique and its application tothe Euclidean one-center problem,SIAM Journal on Computing 15 (1986), 725–738.
N. Megiddo, Linear-time algorithms for linear programming inR 3 and related problems, SIAMJournal on Computing 12 (1983), 759–776.
N. Megiddo, The weighted Euclidean 1-center problem,Mathematics of Operations Research 8 (1983), 498–504.
N. Megiddo, Linear programming in linear time when the dimension is fixed,Journal of the Association for Computing Machinery 31 (1984), 114–127.
N. Megiddo and E. Zemel, A randomizingO(n logn) algorithm for the weighted Euclidean 1-center problem,Journal of Algorithms 7 (1986), 358–368.
J. O'Rourke, S. R. Kosaraju, and N. Megiddo, Computing circular separability,Discrete & Computational Geometry 1 (1986), 105–113.
R. Pollack and M. Sharir, Computing the geodesic center of a simple polygon, Technical Report No. 231, Courant Institute of Mathematical Sciences, New York University, July 1986.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Megiddo, N. On the ball spanned by balls. Discrete Comput Geom 4, 605–610 (1989). https://doi.org/10.1007/BF02187750
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187750