{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:04:22Z","timestamp":1794344662582,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540695134","type":"print"},{"value":"9783540695141","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/11970125_11","type":"book-chapter","created":{"date-parts":[[2007,1,24]],"date-time":"2007-01-24T00:47:40Z","timestamp":1169599660000},"page":"132-145","source":"Crossref","is-referenced-by-count":2,"title":["On Hierarchical Diameter-Clustering, and the Supplier Problem"],"prefix":"10.1007","author":[{"given":"Aparna","family":"Das","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claire","family":"Kenyon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Clustering and Classification","year":"1998","unstructured":"Arabie, P., Hubert, L.J., De Soete, G. (eds.): Clustering and Classification. World Scientific, River Edge (1998)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pp. 626\u2013635 (1997)","DOI":"10.1145\/258533.258657"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11682462_31","volume-title":"LATIN 2006: Theoretical Informatics","author":"M. Chrobak","year":"2006","unstructured":"Chrobak, M., Kenyon, C., Noga, J., Young, N.E.: Online Medians via Online Bribery. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 311\u2013322. Springer, Heidelberg (2006)"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.jcss.2004.10.006","volume":"70","author":"S. Dasgupta","year":"2005","unstructured":"Dasgupta, S., Long, P.: Performance guarantees for hierarchical clustering. Journal of Computer and System Sciences\u00a070(4), 555\u2013569 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR5","volume-title":"Pattern Classification","author":"R.O. Duda","year":"2001","unstructured":"Duda, R.O., Hart, P.E., Sork, D.G.: Pattern Classification. Wiley and Sons, Chichester (2001)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M.E. Dyer","year":"1985","unstructured":"Dyer, M.E., Frieze, A.M.: A simple heuristic for the p-center problem. Operations Research Letters\u00a03, 285\u2013288 (1985)","journal-title":"Operations Research Letters"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Gonzalez, T.F.: Clustering to Minimize the Maximum Intercluster Distance. In: Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, vol.\u00a038, pp. 293\u2013306 (1985)","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"11_CR8","unstructured":"Hochbaum, D.S.: Various Notions of Approximations: Good, Better, Best and More. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems. PWS Publishing Company (1996)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Mathematics of Operations Research\u00a010, 180\u2013184 (1985)","journal-title":"Mathematics of Operations Research"},{"key":"11_CR10","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)"},{"key":"11_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, NY (1990)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Lin, G., Nagarajan, C., Rajamaran, R., Williamson, D.P.: A general approach for incremental approximation and hierarchical clustering. In: Proceedings of the seventeenth annual ACM-SIAM Symposium on Discrete algorithm (SODA), pp. 1147\u20131156 (2006)","DOI":"10.1145\/1109557.1109684"},{"key":"11_CR13","unstructured":"NSF Workshop Report on Emerging Issues in Aerosol Particle Science and Technology (NAST), UCLA, 2003, Chapter 1, Section 18, Improved and rapid data analysis tools (Chemical Characterization), Available at \n                  \n                    http:\/\/www.nano.gov\/html\/res\/NSFAerosolParteport.pdf"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11970125_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:23:46Z","timestamp":1619493826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11970125_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695134","9783540695141"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11970125_11","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11970125","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}