{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T22:59:15Z","timestamp":1768690755806,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540200642","type":"print"},{"value":"9783540396581","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_57","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:24:30Z","timestamp":1279826670000},"page":"630-641","source":"Crossref","is-referenced-by-count":54,"title":["Fast Smallest-Enclosing-Ball Computation in High Dimensions"],"prefix":"10.1007","author":[{"given":"Kaspar","family":"Fischer","sequence":"first","affiliation":[]},{"given":"Bernd","family":"G\u00e4rtner","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Kutz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput.\u00a012, 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Dyer, M.E.: A class of convex programs with applications to computational geometry. In: Proc. 8th Annu. ACM Sympos. Comput. Geom., pp. 9\u201315 (1992)","DOI":"10.1145\/142675.142681"},{"key":"57_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.A. (ed.) New Results and New Trends in Computer Science. LNCS, vol.\u00a0555, pp. 359\u2013370. Springer, Heidelberg (1991)"},{"key":"57_CR4","series-title":"Lecture Notes in Computer Science","first-page":"325","volume-title":"Algorithms - ESA\u201999","author":"B. G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, B.: Fast and robust smallest enclosing balls. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 325\u2013338. Springer, Heidelberg (1999)"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, B., Sch\u00f6nherr, S.: An efficient, exact, and generic quadratic programming solver for geometric optimization. In: Proc. 16th Annu. ACM Sympos. Comput. Geom, pp. 110\u2013118 (2000)","DOI":"10.1145\/336154.336191"},{"key":"57_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1162\/15324430260185565","volume":"2","author":"A. Ben-Hur","year":"2001","unstructured":"Ben-Hur, A., Horn, D., Siegelmann, H.T., Vapnik, V.: Support vector clustering. Journal of Machine Learning Research\u00a02, 125\u2013137 (2001)","journal-title":"Journal of Machine Learning Research"},{"key":"57_CR7","unstructured":"Bulatov, Y., Jambawalikar, S., Kumar, P., Sethia, S.: Hand recognition using geometric classifiers. In: Abstract of presentation for the DIMACS Workshop on Computational Geometry. Rutgers University (2002)"},{"key":"57_CR8","unstructured":"Goel, A., Indyk, P., Varadarajan, K.R.: Reductions among high dimensional proximity problems. In: Symposium on Discrete Algorithms, pp. 769\u2013778 (2001)"},{"key":"57_CR9","unstructured":"Kumar, P., Mitchell, J.S.B., Y\u0131ld\u0131r\u0131m, E.A.: Computing core-sets and approximate smallest enclosing hyperspheres in high dimensions. In: To appear in the Proceedings of ALENEX 2003 (2003)"},{"key":"57_CR10","unstructured":"ILOG, Inc.: ILOG CPLEX 6.5 user\u2019s manual (1999)"},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Zhou, G., Toh, K.C., Sun, J.: Efficient algorithms for the smallest enclosing ball problem (2002) (manuscript)","DOI":"10.1090\/fic\/037\/12"},{"key":"57_CR12","unstructured":"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)"},{"key":"57_CR13","volume-title":"Linear programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Linear programming. W. H. Freeman, New York (1983)"},{"key":"57_CR14","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T09:00:49Z","timestamp":1559293249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}