{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:35:13Z","timestamp":1774370113905,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540438366","type":"print"},{"value":"9783540454359","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45435-7_24","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T21:44:50Z","timestamp":1179265490000},"page":"351-363","source":"Crossref","is-referenced-by-count":25,"title":["Performance Guarantees for Hierarchical Clustering"],"prefix":"10.1007","author":[{"given":"Sanjoy","family":"Dasgupta","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1038\/35000501","volume":"403","author":"A. A. Alizadeh","year":"2000","unstructured":"Alizadeh, A. A., et al. (2000) Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. Nature, 403:503\u2013511.","journal-title":"Nature"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Borodin, A., Ostrovsky, R., & Rabani Y. (1999) Subquadratic approximation algorithms for clustering problems in high dimensional spaces. ACM Symposium on Theory of Computing.","DOI":"10.1145\/301250.301367"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M. & Guha, S. (1999) Improved combinatorial algorithms for facility location and k-median problems. IEEE Foundations of Computer Science.","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"24_CR4","unstructured":"Dasgupta, S. & Schulman, L. J. (2000) A two-round variant of EM for Gaussian mixtures. Uncertainty in Artificial Intelligence."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"14863","DOI":"10.1073\/pnas.95.25.14863","volume":"95","author":"M. B. Eisen","year":"1998","unstructured":"Eisen, M. B., Spellman, P. T., Brown, P. O., & Botstein, D. (1998) Cluster analysis and display of genome-wide expression patterns. Proceedings of the National Academy of Sciences, 95:14863\u201314868.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Feder, T. & Greene, D. (1988) Optimal algorithms for approximate clustering. ACM Symposium on Theory of Computing.","DOI":"10.1145\/62212.62255"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. F. Gonz\u00e1lez","year":"1985","unstructured":"Gonz\u00e1lez, T. F. (1985) Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293\u2013306.","journal-title":"Theoretical Computer Science"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01908064","volume":"2","author":"J. A. Hartigan","year":"1985","unstructured":"Hartigan, J. A. (1985) Statistical theory in clustering. Journal of Classification, 2:63\u201376.","journal-title":"Journal of Classification"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D. & Shmoys, D. (1985) A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10(2):180\u2013184.","journal-title":"Mathematics of Operations Research"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Kearns, M., Mansour, Y. & Ng, A. (1997) An information-theoretic analysis of hard and soft assignment methods for clustering. Uncertainty in Artificial Intelligence.","DOI":"10.1007\/978-94-011-5014-9_18"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Thorup, M. (2001) Quick k-median, k-center, and facility location for sparse graphs. International Colloquium on Automata, Languages, and Programming.","DOI":"10.1007\/3-540-48224-5_21"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45435-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:52:12Z","timestamp":1556398332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45435-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438366","9783540454359"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45435-7_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}