{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:48:57Z","timestamp":1770749337990,"version":"3.50.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0020-0190(98)00132-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"33-38","source":"Crossref","is-referenced-by-count":8,"title":["Exact primitives for smallest enclosing ellipses"],"prefix":"10.1016","volume":"68","author":[{"given":"Bernd","family":"G\u00e4rtner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Sch\u00f6nherr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00132-X_BIB1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01582137","article-title":"A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio","volume":"61","author":"Adler","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB2","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/BF01899996","article-title":"\u00dcber das L\u00f6wnersche Ellipsoid und sein Analogon unter den einem Eik\u00f6rper eingeschriebenen Ellipsoiden","volume":"8","author":"Danzer","year":"1957","journal-title":"Arch. Math."},{"key":"10.1016\/S0020-0190(98)00132-X_BIB3","series-title":"Proc. 8th Annual ACM Symp. on Computational Geometry","first-page":"9","article-title":"A class of convex programs with applications to computational geometry","author":"Dyer","year":"1992"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB4","series-title":"Proc. 13th Annual ACM Symp. on Computational Geometry","first-page":"430","article-title":"Exact primitives for smallest enclosing ellipses","author":"G\u00e4rtner","year":"1997"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB5","series-title":"Proc. 13th Annual Symp. on Theoretical Aspects of Computer Science (STACS)","first-page":"669","article-title":"Linear programming\u2014randomization and abstract frameworks","volume":"Vol. 1046","author":"Gartner","year":"1996"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB6","series-title":"Studies and Essays presented to R. Courant on his 60th Birthday","first-page":"187","article-title":"Extremum problems with inequalities as subsidiary conditions","author":"John","year":"1948"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB7","series-title":"Proc. 8th Annual ACM Symp. Computational Geometry","first-page":"1","article-title":"A subexponential bound for linear programming","author":"Matou\u0161ek","year":"1992"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/204865.204889","article-title":"LEDA: a platform for combinatorial and geometric computing","volume":"38","author":"Mehlhorn","year":"1995","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB9","article-title":"Computing minimum spanning ellipses","author":"Post","year":"1982"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB10","series-title":"Proc. 16th Annual ACM Symp. Theory of Computing","first-page":"108","article-title":"Minimum spanning ellipsoids","author":"Post","year":"1984"},{"issue":"11","key":"10.1016\/S0020-0190(98)00132-X_BIB11","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1016\/0005-1098(94)90075-2","article-title":"Minimum-volume ellipsoids containing compact sets: Applications to parameter bounding","volume":"30","author":"Pronzato","year":"1994","journal-title":"Automatica"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB12","article-title":"Berechnung kleinster Ellipsoide um Punktemengen","author":"Sch\u00f6nherr","year":"1994"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1080\/10556789208805527","article-title":"New algorithms for constructing optimal circumscribed and inscribed ellipsoids","volume":"1","author":"Shor","year":"1992","journal-title":"Opt. Methods Software"},{"key":"10.1016\/S0020-0190(98)00132-X_BIB14","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/0901028","article-title":"Minimum covering ellipses","volume":"1","author":"Silverman","year":"1980","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0020-0190(98)00132-X_BIB15","series-title":"Analytical Conics","author":"Spain","year":"1957"},{"issue":"2","key":"10.1016\/S0020-0190(98)00132-X_BIB16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/biomet\/62.2.313","article-title":"Optimal design: some geometrical aspects of D-optimality","volume":"62","author":"Titterington","year":"1975","journal-title":"Biometrika"},{"issue":"3","key":"10.1016\/S0020-0190(98)00132-X_BIB17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.2307\/2347157","article-title":"Estimation of correlation coefficients by ellipsoidal trimming","volume":"27","author":"Titterington","year":"1978","journal-title":"Appl. Statist."},{"key":"10.1016\/S0020-0190(98)00132-X_BIB18","series-title":"New Results and New Trends in Computer Science","first-page":"359","article-title":"Smallest enclosing disks (balls and ellipsoids)","volume":"Vol. 555","author":"Welzl","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909800132X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909800132X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:54:53Z","timestamp":1556628893000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909800132X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S002001909800132X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00132-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}