{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:01Z","timestamp":1742913181135,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_43","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"640-650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing Cycle-Complete Dissimilarities in Terms of Associated Indexed 2-Hierarchies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1415-062X","authenticated-orcid":false,"given":"Kazutoshi","family":"Ando","sequence":"first","affiliation":[]},{"given":"Kazuya","family":"Shoji","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2017.03.007","volume":"225","author":"K Ando","year":"2017","unstructured":"Ando, K., Inagaki, R., Shoji, K.: Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions. Discrete Appl. Math. 225, 1\u201310 (2017)","journal-title":"Discrete Appl. Math."},{"key":"43_CR2","first-page":"62","volume":"53","author":"K Ando","year":"2010","unstructured":"Ando, K., Kato, S.: Reduction of ultrametric minimum cost spanning tree games to cost allocation games on rooted trees. J. Oper. Res. Soc. Japan 53, 62\u201368 (2010)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"43_CR3","volume-title":"L\u2019analyse des Donn\u00e9es","author":"J-P Benz\u00e9cri","year":"1973","unstructured":"Benz\u00e9cri, J.-P.: L\u2019analyse des Donn\u00e9es. Dunod, Paris (1973)"},{"key":"43_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London (2008)"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(98)00067-3","volume":"192","author":"J Diatta","year":"1998","unstructured":"Diatta, J., Fichet, B.: Quasi-ultrametrics and their 2-ball hypergraphs. Discrete Math. 192, 87\u2013102 (1998)","journal-title":"Discrete Math."},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0025-5564(67)90032-6","volume":"1","author":"CJ Jardin","year":"1967","unstructured":"Jardin, C.J., Jardin, N., Sibson, R.: The structure and construction of taxonomic hierarchies. Math. Biosci. 1, 173\u2013179 (1967)","journal-title":"Math. Biosci."},{"key":"43_CR7","volume-title":"Mathematical Taxonomy","author":"N Jardin","year":"1971","unstructured":"Jardin, N., Sibson, R.: Mathematical Taxonomy. Wiley, New York (1971)"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02289588","volume":"32","author":"SC Johnson","year":"1967","unstructured":"Johnson, S.C.: Hierarchical clustering schemes. Psychometrika 32, 241\u2013254 (1967)","journal-title":"Psychometrika"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02294699","volume":"44","author":"GW Milligan","year":"1979","unstructured":"Milligan, G.W.: Ultrametric hierarchical clustering algorithms. Psychometrika 44, 343\u2013346 (1979)","journal-title":"Psychometrika"},{"key":"43_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.geb.2011.09.002","volume":"75","author":"C Trudeau","year":"2012","unstructured":"Trudeau, C.: A new stable and more responsive cost sharing solution for minimum cost spanning tree problems. Games Econ. Behav. 75, 402\u2013412 (2012)","journal-title":"Games Econ. Behav."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:51:40Z","timestamp":1710345100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}