{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:01Z","timestamp":1750306561826,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,11]],"date-time":"2015-01-11T00:00:00Z","timestamp":1420934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EU","award":["FET MULTIPLEX 317532 and ERC PAAI 259515"],"award-info":[{"award-number":["FET MULTIPLEX 317532 and ERC PAAI 259515"]}]},{"name":"Google"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,11]]},"DOI":"10.1145\/2688073.2688104","type":"proceedings-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T20:42:45Z","timestamp":1421095365000},"page":"211-218","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust Hierarchical k-Center Clustering"],"prefix":"10.1145","author":[{"given":"Silvio","family":"Lattanzi","sequence":"first","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya","family":"Razenshteyn","sequence":"additional","affiliation":[{"name":"MIT, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880933"},{"key":"e_1_3_2_1_2_1","volume-title":"COLT","author":"Balcan N.","year":"2010","unstructured":"Balcan , N. , and Gupta , P . Robust hierarchical clustering . In COLT ( 2010 ). Balcan, N., and Gupta, P. Robust hierarchical clustering. In COLT (2010)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/aama.2001.0758"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365555"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780548"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189769.1189779"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11970125_11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347185"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142400"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/100802888"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276312"},{"key":"e_1_3_2_1_14_1","volume-title":"A best possible heuristic for the k-center problem. Mathematics of operations research 10, 2","author":"Hochbaum D. S.","year":"1985","unstructured":"Hochbaum , D. S. , and Shmoys , D. B . A best possible heuristic for the k-center problem. Mathematics of operations research 10, 2 ( 1985 ), 180--184. Hochbaum, D. S., and Shmoys, D. B. A best possible heuristic for the k-center problem. Mathematics of operations research 10, 2 (1985), 180--184."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"e_1_3_2_1_16_1","volume-title":"Algorithms for Clustering Data","author":"Jain A. K.","year":"1988","unstructured":"Jain , A. K. , and Dubes , R. C . Algorithms for Clustering Data . Prentice-Hall, Inc. , Upper Saddle River, NJ, USA, 1988 . Jain, A. K., and Dubes, R. C. Algorithms for Clustering Data. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1988."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"e_1_3_2_1_18_1","volume-title":"Hierarchical clustering schemes. Psychometrika","author":"Johnson","year":"1967","unstructured":"Johnson ., S. C. Hierarchical clustering schemes. Psychometrika ( 1967 ). Johnson., S. C. Hierarchical clustering schemes. Psychometrika (1967)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_14"},{"key":"e_1_3_2_1_20_1","first-page":"348","volume-title":"Q-clustering. In Advances in Neural Information Processing Systems (NIPS)","author":"Narasimhan M.","year":"2006","unstructured":"Narasimhan , M. , Jojic , N. , and Bilmes , J . Q-clustering. In Advances in Neural Information Processing Systems (NIPS) ( 2006 ), pp. 348 -- 354 . Narasimhan, M., Jojic, N., and Bilmes, J. Q-clustering. In Advances in Neural Information Processing Systems (NIPS) (2006), pp. 348--354."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500845"},{"key":"e_1_3_2_1_22_1","volume-title":"Mode analysis: a generalization of nearest neighbour which reduces chaining effects. Numerical Taxonomy","author":"Wishart","year":"1969","unstructured":"Wishart ., D. Mode analysis: a generalization of nearest neighbour which reduces chaining effects. Numerical Taxonomy ( 1969 ). Wishart., D. Mode analysis: a generalization of nearest neighbour which reduces chaining effects. Numerical Taxonomy (1969)."}],"event":{"name":"ITCS'15: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rehovot Israel","acronym":"ITCS'15"},"container-title":["Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688073.2688104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:04Z","timestamp":1750227184000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,11]]},"references-count":22,"alternative-id":["10.1145\/2688073.2688104","10.1145\/2688073"],"URL":"https:\/\/doi.org\/10.1145\/2688073.2688104","relation":{},"subject":[],"published":{"date-parts":[[2015,1,11]]},"assertion":[{"value":"2015-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}