{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T13:11:14Z","timestamp":1777986674318,"version":"3.51.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319190839","type":"print"},{"value":"9783319190846","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19084-6_5","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"43-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing"],"prefix":"10.1007","author":[{"given":"Sepp","family":"Hartung","sequence":"first","affiliation":[]},{"given":"Holger H.","family":"Hoos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"5_CR1","unstructured":"Gurobi 5.62. Software (2014)"},{"issue":"3","key":"5_CR2","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., Narayanan, B., Paterson, M., Thorup, M.: On the approximability of numerical taxonomy (fitting distances by tree matrices). SIAM J. Comput. 28(3), 1073\u20131085 (1999)","journal-title":"SIAM J. Comput."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M.: Fitting tree metrics: hierarchical clustering and phylogeny. In: Proceedings of the 46th FOCS, pp. 73\u201382 (2005)","DOI":"10.1109\/SFCS.2005.36"},{"issue":"1\u20133","key":"5_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"5_CR5","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. Discrete Algorithms 16, 79\u201389 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-642-39053-1_5","volume-title":"The Nature of Computation","author":"S B\u00f6cker","year":"2013","unstructured":"B\u00f6cker, S., Baumbach, J.: Cluster editing. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 33\u201344. Springer, Heidelberg (2013)"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: evaluation and experiments. Algorithmica 60(2), 316\u2013334 (2011)","journal-title":"Algorithmica"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gionis, A., Gullo, F., Ukkonen, A.: Chromatic correlation clustering. In: Proceedings of 18th ACM SIGKDD (KDD 2012), pp. 1321\u20131329. ACM Press (2012)","DOI":"10.1145\/2339530.2339735"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-38236-9_29","volume-title":"Theory and Applications of Models of Computation","author":"Y Cao","year":"2013","unstructured":"Cao, Y., Chen, J.: On parameterized and kernelization algorithms for the hierarchical clustering problem. In: Chan, T.-H., Lau, L., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 319\u2013330. Springer, Heidelberg (2013)"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 71(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"5_CR11","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. J. Comput. Syst. Sci. 78(1), 211\u2013220 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Dalvi, N., Kumar, R.: Correlation clustering in MapReduce. In: Proceedings of 20th ACM SIGKDD (KDD 2014), pp. 641\u2013650. ACM Press (2014)","DOI":"10.1145\/2623330.2623743"},{"issue":"11","key":"5_CR13","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1007\/s00500-010-0649-0","volume":"15","author":"MAM de Oca","year":"2011","unstructured":"de Oca, M.A.M., Aydin, D., St\u00fctzle, T.: An incremental particle swarm for large-scale continuous optimization problems: an example of tuning-in-the-loop (re)design of optimization algorithms. Soft Comput. 15(11), 2233\u20132255 (2011)","journal-title":"Soft Comput."},{"key":"5_CR14","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)"},{"key":"5_CR15","unstructured":"Fawcett, C., Hoos, H.H.: Analysing differences between algorithm configurations through ablation. In: Proceedings of 10th MIC, pp. 123\u2013132 (2013)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-74240-1_27","volume-title":"Fundamentals of Computation Theory","author":"MR Fellows","year":"2007","unstructured":"Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient parameterized preprocessing for cluster editing. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 312\u2013321. Springer, Heidelberg (2007)"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00224-004-1178-y","volume":"38","author":"J Gramm","year":"2005","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: exact algorithms for clique generation. Theory Comput. Syst. 38(4), 373\u2013392 (2005)","journal-title":"Theory Comput. Syst."},{"issue":"1\u20133","key":"5_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45(1\u20133), 59\u201396 (1989)","journal-title":"Math. Program."},{"issue":"8\u201310","key":"5_CR19","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. 410(8\u201310), 718\u2013726 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Guo, J., Hartung, S., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Exact algorithms and experiments for hierarchical tree clustering. In Proceedings of 24th AAAI. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7684"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"HH Hoos","year":"2012","unstructured":"Hoos, H.H.: Programming by optimization. Commun. ACM 55(2), 70\u201380 (2012)","journal-title":"Commun. ACM"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 5 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011)"},{"key":"5_CR23","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"6","key":"5_CR24","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1524\/itit.2011.9072","volume":"53","author":"P Sanders","year":"2011","unstructured":"Sanders, P., Wagner, D.: Algorithm engineering. It - Inf. Technol. 53(6), 263\u2013265 (2011)","journal-title":"It - Inf. Technol."},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-77918-6_21","volume-title":"Approximation and Online Algorithms","author":"A van Zuylen","year":"2008","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 260\u2013273. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19084-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T03:57:28Z","timestamp":1748404648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}