{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:12:35Z","timestamp":1742955155840,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_29","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"319-330","source":"Crossref","is-referenced-by-count":1,"title":["On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem"],"prefix":"10.1007","author":[{"given":"Yixin","family":"Cao","sequence":"first","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539795296334","volume":"28","author":"R. Agarwala","year":"1999","unstructured":"Agarwala, R., Bafna, V., Farach, M., Paterson, M., Thorup, M.: On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM J. Comput.\u00a028(3), 1073\u20131085 (1999)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1137\/100806886","volume":"40","author":"N. Ailon","year":"2011","unstructured":"Ailon, N., Charikar, M.: Fitting tree metrics: hierarchical clustering and phylogeny. SIAM J. Comput.\u00a040(5), 1275\u20131291 (2011)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM\u00a055(5), Article 23, 1\u201327 (2008)","journal-title":"J. ACM"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jda.2012.04.005","volume":"16","author":"S. B\u00f6cker","year":"2012","unstructured":"B\u00f6cker, S.: A golden ratio parameterized algorithm for cluster editing. J. Discret Algorithms\u00a016, 79\u201389 (2012)","journal-title":"J. Discret Algorithms"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"5467","DOI":"10.1016\/j.tcs.2009.05.006","volume":"410","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q., Truss, A.: Going weighted: parameterized algorithms for cluster editing. Theor. Comput. Sci.\u00a0410, 5467\u20135480 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s00453-011-9595-1","volume":"64","author":"Y. Cao","year":"2012","unstructured":"Cao, Y., Chen, J.: Cluster editing: kernelization based on edge cuts. Algorithmica\u00a064, 152\u2013169 (2012)","journal-title":"Algorithmica"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jcss.2011.04.001","volume":"78","author":"J. Chen","year":"2012","unstructured":"Chen, J., Meng, J.: A 2k kernel for the cluster editing problem. Journal of Computer and System Sciences\u00a078, 211\u2013220 (2012)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Gan, G., Ma, C., Wu, J.: Data Clustering: Theory, Algorithms, and Applications. ASASIAM Series on Statistics and Applied Probability. SIAM (2007)","DOI":"10.1137\/1.9780898718348"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","volume":"410","author":"J. Guo","year":"2009","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci.\u00a0410, 718\u2013726 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Guo, J., Hartung, S., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Exact algorithms and experiments for hierarchical tree clustering. In: Proc. 24th AAAI Conference on Artificial Intelligence, AAAI 2010, pp. 457\u2013462 (2010)","DOI":"10.1609\/aaai.v24i1.7684"},{"key":"29_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A. Jain","year":"1999","unstructured":"Jain, A., Murty, M., Flynn, P.: Data clustering: a review. ACM Comput. Surv.\u00a031, 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M. Krivanek","year":"1986","unstructured":"Krivanek, M., Moravek, J.: NP-hard problems in hierarchical-tree clustering. Acta Informatica\u00a023(3), 311\u2013323 (1986)","journal-title":"Acta Informatica"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Larose, D.: Discovering Knowledge in Data: An Introduction to Data Mining. John Wiley & Sons (2005)","DOI":"10.1002\/0471687545"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Manning, C., Raghavan, P., Sch\u00fctze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511809071"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R. Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math.\u00a0144, 173\u2013182 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"29_CR17","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1287\/moor.1090.0385","volume":"34","author":"A. van Zuylen","year":"2009","unstructured":"van Zuylen, A., Williamson, D.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Mathematics of Operations Research\u00a034(3), 594\u2013620 (2009)","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T01:28:25Z","timestamp":1675214905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}