{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:14:56Z","timestamp":1725563696037},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_42","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"487-499","source":"Crossref","is-referenced-by-count":1,"title":["Stability of \u03b5-Kernels"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff M.","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"42_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.: Approximating extent measure of points. Journal of ACM\u00a051(4), 606\u2013635 (2004)","journal-title":"Journal of ACM"},{"key":"42_CR2","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.: Geometric approximations via coresets. In: Combinatorial and Computational Geometry, pp. 1\u201331 (2005)"},{"key":"42_CR3","unstructured":"Agarwal, P.K., Phillips, J.M., Yu, H.: Stability of \u03b5-kernels. arXiv:1003.5874"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Yu, H.: A space-optimal data-stream algorithm for coresets in the plane. In: SoCG, pp. 1\u201310 (2007)","DOI":"10.1145\/1247069.1247071"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jagm.2000.1127","volume":"38","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. Journ. of Algs.\u00a038, 91\u2013109 (2001)","journal-title":"Journ. of Algs."},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.comgeo.2005.10.002","volume":"35","author":"T. Chan","year":"2006","unstructured":"Chan, T.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Computational Geometry: Theory and Applications\u00a035, 20\u201335 (2006)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Chan, T.: Dynamic coresets. In: SoCG, pp. 1\u20139 (2008)","DOI":"10.1145\/1377676.1377680"},{"key":"42_CR8","unstructured":"Har-Peled, S.: Approximation Algorithm in Geometry, ch. 22 (2010), \n                    \n                      http:\/\/valis.cs.uiuc.edu\/~sariel\/teach\/notes\/aprx\/"},{"key":"42_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.comgeo.2006.10.004","volume":"39","author":"J. Hershberger","year":"2008","unstructured":"Hershberger, J., Suri, S.: Adaptive sampling for geometric problems over data streams. Computational Geometry: Theory and Applications\u00a039, 191\u2013208 (2008)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/s00453-007-9067-9","volume":"52","author":"H. Yu","year":"2008","unstructured":"Yu, H., Agarwal, P.K., Poreddy, R., Varadarajan, K.: Practical methods for shape fitting and kinetic data structures using coresets. Algorithmica\u00a052, 378\u2013402 (2008)","journal-title":"Algorithmica"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Zarrabi-Zadeh, H.: An almost space-optimal streaming algorithm for coresets in fixed dimensions. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 817\u2013829. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-87744-8_68"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T09:17:31Z","timestamp":1552987051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}