{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:15Z","timestamp":1771036335866,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540499947","type":"print"},{"value":"9783540499954","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_6","type":"book-chapter","created":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T04:48:02Z","timestamp":1164689282000},"page":"33-44","source":"Crossref","is-referenced-by-count":11,"title":["Coresets for Discrete Integration and Clustering"],"prefix":"10.1007","author":[{"given":"Sariel","family":"Har-Peled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Coresets for discrete integration and clustering (2006), Available from: http:\/\/www.uiuc.edu\/~sariel\/papers\/06\/integrate","DOI":"10.1007\/11944836_6"},{"key":"6_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy","author":"J. Matou\u0161ek","year":"1999","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy. Springer, Heidelberg (1999)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Kushal, A.: Smaller coresets for k-median and k-means clustering. In: Proc. 21st Annu. ACM Sympos. Comput. Geom., pp. 126\u2013134 (2005)","DOI":"10.1145\/1064092.1064114"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: Coresets for k-means and k-median clustering and their applications. In: Proc. 36th Annu. ACM Sympos. Theory Comput., pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chen, K.: On k-median clustering in high dimensions. In: Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pp. 1177\u20131185 (2006)","DOI":"10.1145\/1109557.1109687"},{"key":"6_CR6","volume-title":"Combinatorial and Computational Geometry","author":"P.K. Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.: Geometric approximation via coresets. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry. Math. Sci. Research Inst. Pub., Cambridge (2005)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Feldman, D., Fiat, A., Sharir, M.: Coresets for weighted facilities and their applications (manuscript 2006)","DOI":"10.1109\/FOCS.2006.22"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of clustering. In: Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci., pp. 240\u2013250 (2000)","DOI":"10.1109\/SFCS.2000.892111"},{"key":"6_CR9","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Approximation algorithms for projective clustering. In: Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp. 538\u2013547 (2000)"},{"key":"6_CR10","unstructured":"B\u0103doiu, M., Clarkson, K.: Smaller coresets for balls. In: Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pp. 801\u2013802 (2003)"},{"key":"6_CR11","unstructured":"Eppstein, D.: Fast hierarchical clustering and other applications of dynamic closest pairs. In: Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, pp. 619\u2013628 (1998)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Proc. 20th Annu. ACM Sympos. Theory Comput., pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. Gonzalez","year":"1985","unstructured":"Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci.\u00a038, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Indyk, P.: A sublinear time approximation scheme for clustering in metric spaces. In: Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci., pp. 100\u2013110 (1999)","DOI":"10.1109\/SFFCS.1999.814587"},{"key":"6_CR15","unstructured":"Mishra, N., Oblinger, D., Pitt, L.: Sublinear time approximate clustering. In: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pp. 439\u2013447 (2001)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/SFCS.2000.892123","volume-title":"Proc. 41st Symp. Foundations of Computer Science","author":"R. Ostrovsky","year":"2000","unstructured":"Ostrovsky, R., Rabani, Y.: Polynomial time approximation schemes for geometric k-clustering. In: Proc. 41st Symp. Foundations of Computer Science, pp. 349\u2013358. IEEE, Los Alamitos (2000)"},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.comgeo.2004.03.003","volume":"28","author":"T. Kanungo","year":"2004","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: A local search approximation algorithm for k-means clustering. Comput. Geom. Theory Appl.\u00a028, 89\u2013112 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of weighted voronoi diagrams and randomization to variance-based k-clustering. In: Proc. 10th Annu. ACM Sympos. Comput. Geom., pp. 332\u2013339 (1994)","DOI":"10.1145\/177424.178042"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: How to get close to the median shape. In: Proc. 22nd Annu. ACM Sympos. Comput. Geom. (to appear, 2006), Available from: http:\/\/www.uiuc.edu\/~sariel\/papers\/05\/l1_fitting\/","DOI":"10.1145\/1137856.1137915"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:53Z","timestamp":1619507873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11944836_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}