{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T10:56:03Z","timestamp":1758279363677},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,5,5]],"date-time":"2009-05-05T00:00:00Z","timestamp":1241481600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10589-009-9248-3","type":"journal-article","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T21:54:49Z","timestamp":1241474089000},"page":"325-340","source":"Crossref","is-referenced-by-count":9,"title":["Minimal containment under homothetics: a simple cutting plane approach"],"prefix":"10.1007","volume":"48","author":[{"given":"Ren\u00e9","family":"Brandenberg","sequence":"first","affiliation":[]},{"given":"Lucia","family":"Roth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,5]]},"reference":[{"key":"9248_CR1","series-title":"MSRI Publications","volume-title":"Combinatorial and Computational Geometry","author":"P. Agarwal","year":"2005","unstructured":"Agarwal, P., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. In: Goodman J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry. MSRI Publications, vol.\u00a052. Cambridge University Press, Cambridge (2005)"},{"key":"9248_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-93014-0","volume-title":"Theorie der konvexen K\u00f6rper","author":"T. Bonnesen","year":"1974","unstructured":"Bonnesen, T., Fenchel, W.: Theorie der konvexen K\u00f6rper. Springer, Berlin (1974). Translation: Theory of Convex Bodies. BCS Associates, Moscow, Idaho (USA) (1987)"},{"key":"9248_CR3","doi-asserted-by":"crossref","unstructured":"Brandenberg, R., Roth, L.: New algorithms for k-center and extensions. J. Comb. Optim. (2009, to appear)","DOI":"10.1007\/s10878-009-9226-9"},{"key":"9248_CR4","first-page":"131","volume-title":"Mathematics\u2014Key Technology for the Future. Joint Projects between Universities and Industry 2004\u20132007","author":"R. Brandenberg","year":"2008","unstructured":"Brandenberg, R., Gerken, T., Gritzmann, P., Roth, L.: Modeling and optimization of correction measures for human extremities. In: J\u00e4ger, W., Krebs, H.-J. (eds.) Mathematics\u2014Key Technology for the Future. Joint Projects between Universities and Industry 2004\u20132007, pp.\u00a0131\u2013148. Springer, Berlin (2008)"},{"key":"9248_CR5","unstructured":"B\u0103doiu, M., Clarkson, K.L.: Smaller coresets for balls. In: Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pp.\u00a0801\u2013802 (2003)"},{"key":"9248_CR6","first-page":"250","volume-title":"Annual ACM Symposium on Theory of Computing archive. Proc. 34th Annu. ACM Sympos. Theory of Computing","author":"M. B\u0103doiu","year":"2002","unstructured":"B\u0103doiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Annual ACM Symposium on Theory of Computing archive. Proc. 34th Annu. ACM Sympos. Theory of Computing, pp.\u00a0250\u2013257. ACM, New York (2002)"},{"key":"9248_CR7","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01583784","volume":"23","author":"B.C. Eaves","year":"1982","unstructured":"Eaves, B.C., Freund, R.M.: Optimal scaling of balls and polyhedra. Math. Program. 23, 138\u2013147 (1982)","journal-title":"Math. Program."},{"key":"9248_CR8","doi-asserted-by":"crossref","unstructured":"Fischer, K., G\u00e4rtner, B., Kutz, M.: Fast smallest-enclosing-ball computation in high dimensions. In: Proc. 11th Annual European Symposium on Algorithms (ESA), pp.\u00a0630\u2013641 (2003)","DOI":"10.1007\/978-3-540-39658-1_57"},{"key":"9248_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-48481-7_29","volume-title":"Proc. 7th Annu. European Symposium on Algorithms (ESA)","author":"B. G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, B.: Fast and robust smallest enclosing balls. In: Proc. 7th Annu. European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol.\u00a01643, pp.\u00a0325\u2013338. Springer, Berlin (1999)"},{"key":"9248_CR10","series-title":"Nonconvex Optimization and Its Applications","volume-title":"Global Optimization: From Theory to Implementation","author":"M. Grant","year":"2005","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications. Kluwer, Dordrecht (2005)"},{"key":"9248_CR11","unstructured":"Grant, M., Boyd, S., Ye, Y.: cvx Users\u2019 guide, version 1.0. http:\/\/www.stanford.edu\/~boyd\/cvx\/cvx_usrguide.pdf , June 2006"},{"key":"9248_CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01581243","volume":"59","author":"P. Gritzmann","year":"1993","unstructured":"Gritzmann, P., Klee, V.: Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Program. 59, 163\u2013213 (1993)","journal-title":"Math. Program."},{"key":"9248_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(94)00111-U","volume":"136","author":"P. Gritzmann","year":"1994","unstructured":"Gritzmann, P., Klee, V.: On the complexity of some basic problems in computational convexity I: Containment problems. Discrete Math. 136, 129\u2013174 (1994)","journal-title":"Discrete Math."},{"key":"9248_CR14","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lovasz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol.\u00a02. Springer, Berlin (1993)"},{"key":"9248_CR15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/jagm.2001.1194","volume":"42","author":"D. Halperin","year":"2002","unstructured":"Halperin, D., Sharir, M., Goldberg, K.: The 2-center problem with obstacles. J. Algorithms 42, 109\u2013134 (2002)","journal-title":"J. Algorithms"},{"key":"9248_CR16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.7146\/math.scand.a-10618","volume":"8","author":"V. Klee","year":"1960","unstructured":"Klee, V.: Circumspheres and inner products. Math. Scand. 8, 363\u2013370 (1960)","journal-title":"Math. Scand."},{"key":"9248_CR17","doi-asserted-by":"crossref","first-page":"1.1","DOI":"10.1145\/996546.996548","volume":"8","author":"P. Kumar","year":"2003","unstructured":"Kumar, P., Mitchell, J.S.B., Y\u0131ld\u0131r\u0131m, E.A.: Approximate minimum enclosing balls in high dimensions using core-sets. J. Exp. Algorithmics 8, 1.1 (2003)","journal-title":"J. Exp. Algorithmics"},{"key":"9248_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of International Conference on Computational Science and Its Applications (ICCSA)","author":"F. Nielsen","year":"2004","unstructured":"Nielsen, F., Nock, R.: Approximating smallest enclosing balls. In: Nielsen, F., Nock, R. (eds.) Proceedings of International Conference on Computational Science and Its Applications (ICCSA). Lecture Notes in Computer Science, vol.\u00a03045. Springer, Berlin (2004)"},{"key":"9248_CR19","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0377-2217(87)90198-6","volume":"29","author":"F. Plastria","year":"1987","unstructured":"Plastria, F.: Solving general continous single facility location problems by cutting planes. Eur. J. Oper. Res. 29, 98\u2013110 (1987)","journal-title":"Eur. J. Oper. Res."},{"key":"9248_CR20","unstructured":"P\u00f3lik, I.: Addendum to the SeDuMi user guide version 1.1. Technical report, Advanced Optimization Laboratory, McMaster University (2005)"},{"key":"9248_CR21","unstructured":"Roth, L.: Exakte und \u03b5-approximative Algorithmen zur Umkugelberechnung. Diploma thesis, Zentrum Mathematik, TU M\u00fcnchen, October 2005"},{"key":"9248_CR22","series-title":"Encyclopedia of Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526282","volume-title":"Convex Bodies: The Brunn-Minkowski Theory","author":"R. Schneider","year":"1993","unstructured":"Schneider, R.: Convex Bodies: The Brunn-Minkowski Theory. Encyclopedia of Mathematics and Its Applications, vol.\u00a044. Cambridge University Press, Cambridge (1993)"},{"key":"9248_CR23","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11-12","author":"J.F. Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11-12, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9248_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E. Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H. (ed.) New Results and New Trends in Computer Science. Lecture Notes in Computer Science, vol.\u00a0555, pp.\u00a0359\u2013370. Springer, Berlin (1991)"},{"key":"9248_CR25","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11, 721\u2013736 (1982)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9248_CR26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10589-005-4565-7","volume":"30","author":"G.L. Zhou","year":"2005","unstructured":"Zhou, G.L., Toh, K.C., Sun, J.: Efficient algorithms for the smallest enclosing ball problem. Comput. Optim. Appl. 30(2), 147\u2013160 (2005)","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9248-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9248-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9248-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:36Z","timestamp":1559302596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9248-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,5]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9248"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9248-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,5]]}}}