{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T17:14:01Z","timestamp":1764350041775},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_111","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T14:58:59Z","timestamp":1279465139000},"page":"1374-1385","source":"Crossref","is-referenced-by-count":15,"title":["Linear Time Algorithms for Clustering Problems in Any Dimensions"],"prefix":"10.1007","author":[{"given":"Amit","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"111_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 2\u201311 (1996)","DOI":"10.1109\/SFCS.1996.548458"},{"key":"111_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 106\u2013113 (1998)","DOI":"10.1145\/276698.276718"},{"key":"111_CR3","doi-asserted-by":"crossref","unstructured":"Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 250\u2013257 (2002)","DOI":"10.1145\/509907.509947"},{"key":"111_CR4","unstructured":"Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Approximating algorithms for NP-Hard problems, pp. 296\u2013345. PWS Publishing Company (1997)"},{"key":"111_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A., Glassman, S., Manasse, M., Zweig, G.: Syntactic clustering of the Web. In: Proc. of 6th International World Wide Web Conference, pp. 391\u2013404 (1997)","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"111_CR6","doi-asserted-by":"crossref","unstructured":"de la Vega, W.F., Karpinski, M., Kenyon, C., Rabani, Y.: Approximation schemes for clustering problems. In: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp. 50\u201358 (2003)","DOI":"10.1145\/780542.780550"},{"issue":"6","key":"111_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S. Deerwester","year":"1990","unstructured":"Deerwester, S., Dumais, S.T., Landauer, T.K., Furnas, G.W., Harshman, R.A.: Indexing by latent semantic analysis. Journal of the American Society for Information Science\u00a041(6), 391\u2013407 (1990)","journal-title":"Journal of the American Society for Information Science"},{"key":"111_CR8","volume-title":"Pattern Classification","author":"R.O. Duda","year":"2001","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley-Interscience, New York (2001)","edition":"2"},{"issue":"3","key":"111_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C. Faloutsos","year":"1994","unstructured":"Faloutsos, C., Barber, R., Flickner, M., Hafner, J., Niblack, W., Petkovic, D., Equitz, W.: Efficient and effective querying by image content. Journal of Intelligent Information Systems\u00a03(3), 231\u2013262 (1994)","journal-title":"Journal of Intelligent Information Systems"},{"key":"111_CR10","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"111_CR11","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering. In: Proceedings of the tenth annual symposium on Computational Geometry, pp. 332\u2013339 (1994)","DOI":"10.1145\/177424.178042"},{"key":"111_CR12","unstructured":"Indyk, P.: High Dimensional Computational Geometry. Ph.D. Thesis. Department of Computer Science, Stanford University (2004)"},{"key":"111_CR13","doi-asserted-by":"crossref","unstructured":"Kolliopoulos, S., Rao, S.: A nearly linear time approximation scheme for the Euclidean k-medians problem. In: Proceedings of the 7th European Symposium on Algorithms, pp. 362\u2013371 (1999)","DOI":"10.1007\/3-540-48481-7_33"},{"key":"111_CR14","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: A simple linear time (1\u2009+\u2009\u03b5)-approximation algorithm for k-means clustering in any dimensions. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 454\u2013462 (2004)","DOI":"10.1109\/FOCS.2004.7"},{"key":"111_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s004540010019","volume":"24","author":"J. Matousek","year":"2000","unstructured":"Matousek, J.: On approximate geometric k-clustering. Discrete and Computational Geometry\u00a024, 61\u201384 (2000)","journal-title":"Discrete and Computational Geometry"},{"key":"111_CR16","doi-asserted-by":"crossref","unstructured":"Swain, M.J., Ballard, D.H.: Color indexing. International Journal of Computer Vision, 11\u201332 (1991)","DOI":"10.1007\/BF00130487"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_111.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:46:52Z","timestamp":1619491612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11523468_111","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}