Thuật toán loại đơn giản kép cho viên cầu nhỏ nhất bao quanh các viên cầu

Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets, in Combinatorial and Computational Geometry, pp. 1–30. University Press, MSRI (2005) Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95, 3–51 (2003) Ben-Hur, A., Horn, D., Siegelmann, H.T., Vapnik, V.: Support vector clustering. J. Mach. Learn. Res. 2, 125–137 (2002) Bădoiu, M., Clarkson, K.L.: Optimal core-sets for balls. Comput. Geometry 40, 14–22 (2008) Bădoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proc. 34th Annual ACM Symp. on Theory of Computing, STOC ’02, New York, NY, USA, ACM, pp. 250–257 (2002) Bulatov, Y., Jambawalikar, S., Kumar, P., Sethia, S.: Hand recognition using geometric classifiers in authentication biometric, pp. 753–759. Springer, Heidelberg (2004) Cavaleiro, M.: Simplex-Like Methods for Spherical Enclosure of Points and Spheres - Algorithms and Applications, Ph.D. Thesis, Rutgers University (2020) Cavaleiro, M., Alizadeh, F.: A faster dual algorithm for the Euclidean minimum covering ball problem. Annal Op Res 5, 1056 (2018) Chapelle, O., Vapnik, V., Bousquet, O., Mukherjee, S.: Choosing multiple parameters for support vector machines. Mach Learn 46, 131–159 (2002) Dearing, P.M., Zeck, C.R.: A dual algorithm for the minimum covering ball problem in \(\mathbb{R}^n\). Op Res Lett 37, 171–175 (2009) Dyer, M.: A class of convex programs with applications to computational geometry. In: Proc. of the 8th Annual Symp. on Computational Geometry, SCG ’92, New York, NY, USA, ACM, pp. 9–15 (1992) Dyer, M., Gärtner, B., Megiddo, N., Welzl, E.: Linear programming. Chapman and Hall/CRC, Boca Raton (2017) Dyer, M., Megiddo, N., Welzl, E.: Linear programming. Chapman and Hall/CRC, Boca Raton (2004) Fischer, K., Gärtner, B.: The smallest enclosing ball of balls: combinatorial structure and algorithms. Int. J. Comput. Geometry Appl. 14, 341–387 (2004) Fischer, K., Gärtner, B., Kutz, M.: Fast smallest-enclosing-ball computation in high dimensions, in Algorithms - ESA. Lecture Notes in Computer Science, vol. 2832. Springer 2003, 630–641 (2003) Gill, P.E., Golub, G.H., Murray, W., Saunders, M.A.: Methods for modifying matrix factorizations. Math. Comput. 28, 505–535 (1974) Goldfarb, D.: Factorized variable metric methods for unconstrained optimization. Math. Comput. 30, 796–811 (1976) Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27, 1–33 (1983) Golub, G.H., Van Loan, C.: Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996) Hale, T.S., Moberg, C.R.: Location science research: a review. Annal. Op. Res. 123, 21–35 (2003) Hubbard, P.M.: Approximating polyhedra with spheres for time-critical collision detection. ACM Trans. Gr. 15, 179–210 (1996) Källberg, L., Larsson, T.: Faster approximation of minimum enclosing balls by distance filtering and GPU parallelization. J. Gr. Tools 17, 67–84 (2013) Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Approximate minimum enclosing balls in high dimensions using core-sets. ACM J. Exp. Algorithm. 8, 689 (2003) Larsson, T., Capannini, G., Källberg, L.: Parallel computation of optimal enclosing balls by iterative orthant scan. Computers & Gr 56, 1–10 (2016) Larsson, T., Källberg, L.: Fast and robust approximation of smallest enclosing balls in arbitrary dimensions. In: Proc. 11th Eurographics/ACMSIGGRAPH Symp. on Geometry Processing, SGP ’13, Aire-la-Ville, Switzerland, Eurographics Association, pp. 93–101 (2013) Megiddo, N.: On the ball spanned by balls, discrete. Comput. Geom. 4, 605–610 (1989) Moradi, E., Bidkhori, M.: Single facility location problem. In: Location, Facility (ed.) Concepts, pp. 37–68. Physica-Verlag HD, Models, Algorithms and Case Studies, Heidelberg (2009) Mordukhovich, B., Nam, N.M., Villalobos, C.: The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions. Optim. Lett. 7, 839–853 (2013) MOSEK ApS: The MOSEK optimization toolbox for MATLAB manual. Version 8.1 (2017) Nam, N.M., Hoang, N., An, N.T.: Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls. J. Optim. Theor. Appl. 160, 483–509 (2014) Nam, N.M., Nguyen, T.A., Salinas, J.: Applications of convex analysis to the smallest intersecting ball problem. J. Convex Anal. 19, 497–518 (2012) Nielsen, F., Nock, R.: Approximating smallest enclosing balls with applications to machine learning. Int. J. Comput. Geom. Appl. 19, 389–414 (2009) Panigrahy, R.: Minimum enclosing polytope in high dimensions, CoRR, cs.CG/0407020 (2004) Plastria, F.: Continuous covering location problems. In: Location, Facility (ed.) Applications and Theory, pp. 37–79. Springer, Berlin (2002) Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: STACS 92, Berlin, Heidelberg, pp. 567–579. Springer (1992) Toh, K.C., Todd, M.: SDPT3 - a MATLAB software package for semidefinite programming. Optim. Methods Softw. 11, 545–581 (1999) Tsang, I.W., Kwok, J.T., Cheung, P.-M.: Core vector machines: fast SVM training on very large data sets. J. Mach. Learn. Res. 6, 363–392 (2005) Yildirim, E.A.: Two algorithms for the minimum enclosing ball problem. SIAM J. Optim. 19, 1368–1391 (2008) Zhou, G., Tohemail, K.-C., Sun, J.: Efficient algorithms for the smallest enclosing ball problem. Comput. Optim. Appl. 30, 147–160 (2005)