{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T18:56:23Z","timestamp":1768676183208,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-022-00851-4","type":"journal-article","created":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T16:41:50Z","timestamp":1646152910000},"page":"617-634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hierarchy cost of hierarchical clusterings"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9106-4813","authenticated-orcid":false,"given":"Felix","family":"Bock","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,1]]},"reference":[{"issue":"1","key":"851_CR1","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/s00453-012-9717-4","volume":"69","author":"MR Ackermann","year":"2014","unstructured":"Ackermann MR, Bl\u00f6mer J, Kuntze D, Sohler C (2014) Analysis of agglomerative clustering. Algorithmica 69(1):184\u2013215","journal-title":"Algorithmica"},{"issue":"6","key":"851_CR2","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1137\/S0097539702418498","volume":"33","author":"M Charikar","year":"2004","unstructured":"Charikar M, Chekuri C, Feder T, Motwani R (2004) Incremental clustering and dynamic information retrieval. SIAM J Comput 33(6):1417\u20131440","journal-title":"SIAM J Comput"},{"issue":"4","key":"851_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3321386","volume":"66","author":"V Cohen-Addad","year":"2019","unstructured":"Cohen-Addad V, Kanade V, Mallmann-Trenn F, Mathieu C (2019) Hierarchical clustering: objective functions and algorithms. J ACM (JACM) 66(4):1\u201342","journal-title":"J ACM (JACM)"},{"issue":"2","key":"851_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00453-011-9586-2","volume":"65","author":"J Csirik","year":"2013","unstructured":"Csirik J, Epstein L, Imreh C, Levin A (2013) Online clustering with variable sized clusters. Algorithmica 65(2):251\u2013274","journal-title":"Algorithmica"},{"key":"851_CR5","doi-asserted-by":"crossref","unstructured":"Dasgupta S (2016) A cost function for similarity-based hierarchical clustering. In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pp 118\u2013127","DOI":"10.1145\/2897518.2897527"},{"issue":"4","key":"851_CR6","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 PM (2005) Performance guarantees for hierarchical clustering. J Comput Syst Sci 70(4):555\u2013569","journal-title":"J Comput Syst Sci"},{"key":"851_CR7","doi-asserted-by":"crossref","unstructured":"Feder T, Greene D(1988) Optimal algorithms for approximate clustering. In: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp 434\u2013444","DOI":"10.1145\/62212.62255"},{"key":"851_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38:293\u2013306","journal-title":"Theor Comput Sci"},{"issue":"4","key":"851_CR9","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s00453-017-0284-6","volume":"78","author":"A Grosswendt","year":"2017","unstructured":"Grosswendt A, Roeglin H (2017) Improved analysis of complete-linkage clustering. Algorithmica 78(4):1131\u20131150","journal-title":"Algorithmica"},{"issue":"2","key":"851_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Shmoys DB (1985) A best possible heuristic for the k-center problem. Math Oper Res 10(2):180\u2013184","journal-title":"Math Oper Res"},{"issue":"1","key":"851_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1002\/widm.53","volume":"2","author":"F Murtagh","year":"2012","unstructured":"Murtagh F, Contreras P (2012) Algorithms for hierarchical clustering: an overview. Wiley Interdiscip Rev Data Min Knowl Discov 2(1):86\u201397","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00851-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00851-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00851-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:31:07Z","timestamp":1659079867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00851-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["851"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00851-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"assertion":[{"value":"1 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}