{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:05:51Z","timestamp":1648735551483},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T00:00:00Z","timestamp":1339027200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10898-012-9932-1","type":"journal-article","created":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T12:33:26Z","timestamp":1338986006000},"page":"27-42","source":"Crossref","is-referenced-by-count":0,"title":["From approximate balls to approximate ellipses"],"prefix":"10.1007","volume":"56","author":[{"given":"Asish","family":"Mukhopadhyay","sequence":"first","affiliation":[]},{"given":"Eugene","family":"Greene","sequence":"additional","affiliation":[]},{"given":"Animesh","family":"Sarker","sequence":"additional","affiliation":[]},{"given":"Tom","family":"Switzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,7]]},"reference":[{"key":"9932_CR1","doi-asserted-by":"crossref","unstructured":"Bagchi, A., Chaudhary, A., Eppstein, D., Goodrich, M.T.: Deterministic sampling and range counting in geometric data streams. In: ACM Transactions on Algorithms (TALG), vol. 3 (2007)","DOI":"10.1145\/1240233.1240239"},{"key":"9932_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, volume 2 of MPS\/SIAM Series on Optimization","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal A., Nemirovski A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, volume 2 of MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"key":"9932_CR3","doi-asserted-by":"crossref","unstructured":"Dyer, M.E.: A class of convex programs with applications to computational geometry. In: Symposium on Computational Geometry, pp. 9\u201315 (1992)","DOI":"10.1145\/142675.142681"},{"issue":"1","key":"9932_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00453-004-1105-2","volume":"41","author":"J. Feigenbaum","year":"2004","unstructured":"Feigenbaum J., Kannan S., Zhang J.: Computing diameter in the streaming and sliding-window models. Algorithmica 41(1), 25\u201341 (2004)","journal-title":"Algorithmica"},{"key":"9932_CR5","unstructured":"Henzinger, M., Raghavan, P., Rajagopalan S.: Computing on Data Streams. Technical Report SRC-TN-1998-011, Hewlett Packard Laboratories (1998)"},{"key":"9932_CR6","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri S.: Adaptive sampling for geometric problems over data streams. In: PODS: 23th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2004)","DOI":"10.1145\/1055558.1055595"},{"key":"9932_CR7","doi-asserted-by":"crossref","unstructured":"Isenburg, L., Shewchuk, J., Snoeyink, J.: Illustrating the streaming construction of 2D delaunay triangulations (short). In: COMPGEOM: Annual ACM Symposium on Computational Geometry (2006)","DOI":"10.1145\/1137856.1137929"},{"issue":"2","key":"9932_CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S. Muthukrishnan","year":"2005","unstructured":"Muthukrishnan S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"9932_CR9","doi-asserted-by":"crossref","unstructured":"Post, M.J.: A minimum spanning ellipse algorithm. In: FOCS, pp. 115\u2013122, IEEE (1981)","DOI":"10.1109\/SFCS.1981.7"},{"issue":"4","key":"9932_CR10","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/0901028","volume":"1","author":"B.W. Silverman","year":"1980","unstructured":"Silverman B.W., Titterington D.M.: Minimum covering ellipses. SIAM J. Sci. Stat. Comput. 1(4), 401\u2013409 (1980)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"9932_CR11","unstructured":"Weisstein, E.W.: Ellipse. From MathWorld\u2014A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Ellipse.html ."},{"key":"9932_CR12","doi-asserted-by":"crossref","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). Lecture Notes in Computer Science, vol. 555, pp. 359\u2013370 (1991)","DOI":"10.1007\/BFb0038202"},{"key":"9932_CR13","unstructured":"Zarrabi-Zadeh H., Chan T.: A simple streaming algorithm for minimum enclosing balls. In: Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG\u201906), pp. 139\u2013142 (2006)"},{"key":"9932_CR14","unstructured":"Zarrabi-Zadeh, H., Mukhopadhyay, A.: Streaming 1-center with outliers in high dimensions. In: Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG\u201909), pp. 83\u201386 (2009)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9932-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9932-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9932-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T12:44:36Z","timestamp":1561812276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9932-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9932"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9932-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,7]]}}}