Approximate minimum enclosing balls in high dimensions using core-sets

ACM Journal of Experimental Algorithmics

Volumn 8, Issue , 2003, Pages

  Kumar, Piyush ^a   Mitchell, Joseph S B ^a   Yildirim, E Alper ^a  

^a Stony Brook University   (United States)

Author keywords

Approximation algorithms; Core sets; F.2.0 analysis of algorithms and problem complexity : general geometrical problems and computations; Minimum enclosing ball; Second order cone programming

Indexed keywords

EID: 72849123507     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/996546.996548     Document Type: Article

References (37)

1. F. Alizadeh and D. Goldfarb. Second-order cone programming. Mathematical Programming, Series B 95/1: 3-51, 2003.
2. st Annual Symposium on Foundations of Computer Science, pages 240-250. IEEE Computer Society Press, Los Alamitos, CA, 2000.
3. Y. Bulatov, S. Jambawalikar, P. Kumar and S. Sethia. Hand recognition using geometric classifiers. Manuscript, 2002.
4. A. Ben-Hur, D. Horn, H. T. Siegelmann and V. Vapnik. Support vector clustering. In Journal of Machine Learning, 2002.
5. th Annual ACM Symposium on Theory of Computing, pages 250-257, 2002.
6. th ACM-SIAM Symposium on Discrete Algorithms, pages 801-802, 2003.
7. M. Bədoiu and K. L. Clarkson. Optimal core-sets for balls. Manuscript, 2002.
8. C. J. C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):121-167, 1998.
9. th Annual ACM Symposium on Computational Geometry, pages 300-309, 2000.
10. O. Chapelle, V. Vapnik, O. Bousquet and S. Mukherjee. Choosing multiple parameters for support vector machines. Machine Learning, 46(1/3):131, 2002.
11. O. Eg˜eciog˜lu and B. Kalantari. Approximating the diameter of a set of points in the Euclidean space. Information Processing Letters, 32:205-211, 1989.
12. th Annual Symposium on Foundations of Computer Science, 1999.
13. D. J. Elzinga and D. W. Hearn. The minimum covering sphere problem. Management Science, 19(1):96-104, 1972.
14. K. Fischer. Smallest enclosing ball of balls. Diploma thesis, Institute of Theoretical Computer Science, ETH Zurich, 2001.
15. th Annual ACM Symposium on Computational Geometry, pages 292-301, 2003.
16. th Annual European Symposium on Algorithms (ESA), pages 630-641, LNCS 2832, Springer-Verlag, 2003.
17. th Annual European Symposium on Algorithms (ESA), pages 325-338, LNCS 1643, Springer-Verlag, 1999.
18. th Annual ACM Symposium on Computational Geometry, pages 110-118, 2000.
19. th ACM-SIAM Symposium on Discrete Algorithms, pages 769-778, 2001.
20. P. M. Hubbard. Approximating polyhedra with spheres for time-critical collision detection. ACM Transactions on Graphics, 15(3):179-210, 1996.
21. W. Johnson and J. Lindenstrauss Extensions of Lipschitz maps into a Hilbert space. Contemp. Math. 26, pages 189-206, 1984.
22. M. S. Lobo, L. Vandenberghe, S. Boyd and H. Lebret. Applications of second-order cone programming. Linear Algebra and Its Applications, 248:193-228, 1998.
23. th Annual ACM Symposium on Computational Geometry, pages 1-8, 1992.
24. Y. E. Nesterov and A. S. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM Publications, Philadelphia, 1994.
25. Y. E. Nesterov and M. J. Todd. Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations Research, 22:1-42, 1997.
26. Y. E. Nesterov and M. J. Todd. Primal-dual interior-point methods for self-scaled cones. SIAM Journal on Optimization, 8:324-362, 1998.
27. th ACM-SIAM Symposium on Discrete Algorithms, 2001.
28. J. Renegar. A Mathematical View of Interior-Point Methods in Convex Optimization. MPS/SIAM Series on Optimization 3. SIAM Publications, Philadelphia, 2001.
29. S. Har-Peled. Manuscript, 2002. Personal communication.
30. P. Kumar, J. S. B. Mitchell and A. Yildirim. Computing Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. In Proc. Fifth Workshop on Algorithm Engineering and Experiments, Richard E. Ladner, ed., pages 45-55, SIAM, 2003.
31. J. F. Sturm. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods and Software, 11/12:625-653, 1999.
32. K. C. Toh, M. J. Todd and R. H. Tütüncü. SDPT3 - a Matlab software package for semidefinite programming. Optimization Methods and Software, 11:545-581, 1999. http://www.math.nus.edu.sg/~mattohkc/sdpt3.html.
33. R. H. Tütüncü, K. C. Toh and M. J. Todd. Solving semidefinite-quadratic-linear programs using SDPT3. Mathematical Programming, Series B, 95/2:189-217, 2003.
34. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In Maurer, H., ed.: New Results and New Trends in Computer Science, pages 359-370, LNCS 555, Springer-Verlag, 1991.
35. S. Xu, R. Freund and J. Sun. Solution methodologies for the smallest enclosing circle problem. Technical report, Singapore-MIT Alliance, National University of Singapore, Singapore, 2001.
36. E. A. Yildirim and S. J. Wright Warm-Start Strategies in Interior-Point Methods for Linear Programming. SIAM Journal on Optimization 12/3, pages 782-810, 2002.
37. G. Zhou, J. Sun and K.-C. Toh. Efficient algorithms for the smallest enclosing ball problem in high dimensional space. Technical report, 2002. To appear, Proceedings of Fields Institute of Mathematics.