A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)

1. Dearing P.M., Zeck C.R.: A dual algorithm for the minimum covering ball problem in \({\mathbb{R}^n}\) . Oper. Res. Lett. 37, 171–175 (2009)

   Article  Google Scholar 

2. Sylvester J.J.: A question in the geometry of situation. Quart. J. Pure Appl. Math. 1, 79 (1857)

   Google Scholar 

3. Sylvester, J.J.: On Poncelet’s approximation linear valuation of surd forms. Philos Mag (Fourth Series Vol. XX), 203–222 (1860)

4. Chrystal G.: On the problem to construct the minimum circle enclosing n given points in the plane. Proc. Edinb. Math. Soc. 3, 30–33 (1885)

   Article  Google Scholar 

5. Elzinga J., Hearn D.W.: Geometrical solutions for some minimax location problems. Transp. Sci. 6, 379–394 (1972)

   Article  Google Scholar 

6. Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J.R., Urrutia, J. (eds.), Handbook of Computational Geometry, pp. 201–290. North Holland, Amsterdam (2000)

   Chapter  Google Scholar 

7. Megiddo N.: Linear time algorithm for linear programming in \({\mathbb{R}^3}\) and related problems. SIAM J. Comput. 12, 759–776 (1983)

   Article  Google Scholar 

8. Elzinga J., Hearn D.W.: The minimum covering sphere problem. Manag. Sci. 19, 96–104 (1972)

   Article  Google Scholar 

9. Hopp, T.H., Reeve, C.P.: An algorithm for computing the minimum covering sphere in any dimension, Technical Report NISTIR 5831. National Institute of Standards and Technology (1996)

10. Fischer, K., Gärtner, B., Kutz, M.: Fast smallest-enclosing-ball computation in high dimensions. In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA) Lecture Notes Computer Science, vol. 2832, Springer, pp. 630–641 (2003)

11. Zhou G., Toh K., Sun J.: Efficient algorithms for the smallest enclosing ball problem. Comput. Optim. Appl. 30, 147–160 (2005)

    Article  Google Scholar 

12. Dyer, M.E.: A class of convex programs with applications to computational geometry. In: Proceedings 8th Annual ACM Sympossium on Computational Geometry, pp. 9–15 (1992)

13. Welzl E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H. (eds) New Results and New Trends in Computer Science, vol. 555, Lecture Notes in Computer Science, pp. 359–370. Springer, Berlin (1991)

    Chapter  Google Scholar 

14. Gärtner, B.: Fast and robust smallest enclosing balls. In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 1643, Springer, pp. 325–338 (1999)

15. Gärtner, B., Schönherr, S.: An efficient, exact, and generic quadratic programming solver for geometric optimization. In: Proceedings of the 16th Annual ACM Symposium on Computational Geometry, pp. 110–118 (2000)

16. Megiddo N.: Linear programming in linear time when the dimension is fixed. JACM 31, 114–127 (1984)

    Article  Google Scholar 

17. Berman P., Kovooor N., Pardalos P.: Algorithms for the least distance problem. In: Pardalos, P. (ed.) Complexity in Numerical Optimization, pp. 33–56. World Scientific, Singapore (1993)

    Chapter  Google Scholar 

18. Hearn D.W., Vijay J.: Efficient algorithms for the weighted minimum circle problem. Oper. Res. 30, 777–795 (1982)

    Article  Google Scholar 

19. Megiddo N.: The weighted euclidean 1-center problem. Math. Oper. Res. 8, 498–504 (1983)

    Article  Google Scholar 

20. Plastria F.: Continuous covering location problems. In: Drezner, Z., Hamacher, H.W. (eds) Facility Location: Application and Theory, pp. 37–79. Springer, New York (2002)

    Chapter  Google Scholar 

Download references