{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:18:08Z","timestamp":1767986288564,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10589-025-00725-5","type":"journal-article","created":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T07:13:39Z","timestamp":1758179619000},"page":"267-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A heuristic algorithm for the cluster editing problem"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5297-055X","authenticated-orcid":false,"given":"Keisuke","family":"Murakami","sequence":"first","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,18]]},"reference":[{"issue":"1\u20132","key":"725_CR1","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. Discret. Appl. Math. 144(1\u20132), 173\u2013182 (2004)","journal-title":"Discret. Appl. Math."},{"key":"725_CR2","first-page":"391","volume":"6","author":"TS Rahmann","year":"2007","unstructured":"Rahmann, T.S., Wittkop, J., B., M., M., Truss, A., Bocker, S,: Exact and heuristic algorithms for weighted cluster editing. Comput. Syst. Bioinf. 6, 391\u2013401 (2007)","journal-title":"Comput. Syst. Bioinf."},{"key":"725_CR3","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., Huffner, F., Niedermeier, R.: Graph-modeled data clustering: exact algorithms for clique generation. Theor. Comput. Syst. 38, 373\u2013392 (2005)","journal-title":"Theor. Comput. Syst."},{"key":"725_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00224-008-9130-1","volume":"46","author":"P Damaschke","year":"2010","unstructured":"Damaschke, P.: Fixed-parameter enumerability of cluster editing and related problems. Theor. Comput. Syst. 46, 261\u2013283 (2010)","journal-title":"Theor. Comput. Syst."},{"key":"725_CR5","doi-asserted-by":"crossref","unstructured":"Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: Implementations and experiments. Parameterized and Exact Computation: Second International Workshop, Proceedings 2, 13\u201324 (2006)","DOI":"10.1007\/11847250_2"},{"issue":"1","key":"725_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.disopt.2010.09.006","volume":"8","author":"R Michael","year":"2011","unstructured":"Michael, R.: Fellows and Jiong Guo and Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann: graph-based data clustering with overlaps. Discret. Optim. 8(1), 2\u201317 (2011)","journal-title":"Discret. Optim."},{"issue":"1","key":"725_CR7","first-page":"161","volume":"258","author":"GFD Sousa Filho","year":"2017","unstructured":"Sousa Filho, G.F.D., Bastos, J.P., Maculan, N.: New heuristics for the bicluster editing problem. Ann. Oper. Res. 258(1), 161\u2013178 (2017)","journal-title":"Ann. Oper. Res."},{"key":"725_CR8","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S Bocker","year":"2011","unstructured":"Bocker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: evaluation and experiments. Algorithmica 60, 316\u2013334 (2011)","journal-title":"Algorithmica"},{"key":"725_CR9","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discret. Appl. Math. 160, 2259\u20132270 (2012)","journal-title":"Discret. Appl. Math."},{"key":"725_CR10","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. Theoret. Comput. Sci. 410, 718\u2013726 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"725_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, 211\u2013220 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"725_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-8-396","volume":"8","author":"T Wittkop","year":"2007","unstructured":"Wittkop, T., Baumbach, J., Lobo, F.P., Rahmann, S.: Large scale clustering of protein sequences with force-a layout based heuristic for weighted cluster editing. BMC Bioinf. 8, 1\u201312 (2007)","journal-title":"BMC Bioinf."},{"key":"725_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-1-4757-4305-0_3","volume-title":"Survey of Text Mining: Clustering, Classification, and Retrieval","author":"H Frigui","year":"2004","unstructured":"Frigui, H., Nasraoui, O.: Simultaneous clustering and dynamic keyword weighting for text documents. In: Survey of Text Mining: Clustering, Classification, and Retrieval, pp. 45\u201372. Springer, Berlin (2004)"},{"issue":"3","key":"725_CR14","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."},{"key":"725_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10878-014-9756-7","volume":"31","author":"L Bastos","year":"2016","unstructured":"Bastos, L., Ochi, L.S., Protti, F., Subramanian, A., Martins, I.C., Pinheiro, R.G.S.: Efficient algorithms for cluster editing. J. Comb. Optim. 31, 347\u2013371 (2016)","journal-title":"J. Comb. Optim."},{"key":"725_CR16","unstructured":"Blasius, T., Fischbeck, P., Gottesburen, L., Hamann, M., Heuer, T., Spinner, J., Wilhelm, M.: Pace solver description: Kapoce: A heuristic cluster editing algorithm. In: 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Schloss Dagstuhl-Leibniz-Zentrum fur Informatik, (2021)"},{"key":"725_CR17","unstructured":"PACE Challenge 2021: Parameterized Algorithms and Computational Experiments Challenge 2021, https:\/\/pacechallenge.org\/2021\/ (2021)"},{"key":"725_CR18","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. In: Proceedings of the 36th Annual ACM\/IEEE Design Automation Conference (1999)","DOI":"10.1155\/2000\/19436"},{"issue":"3","key":"725_CR19","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E-Statis. Nonlinear Soft Matter Phys. 76(3), 036106 (2007)","journal-title":"Phys. Rev. E-Statis. Nonlinear Soft Matter Phys."},{"key":"725_CR20","unstructured":"GitHub Repository: Cluster Editing by Kittobi1992, https:\/\/github.com\/kittobi1992\/cluster_editing (2024)"},{"issue":"4","key":"725_CR21","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"key":"725_CR22","unstructured":"PACE Challenge 2021: Cluster Editing PACE 2021 Instances (Heuristics), https:\/\/github.com\/PACE-challenge\/Cluster-Editing-PACE-2021-instances\/tree\/main\/heur (2021)"},{"key":"725_CR23","unstructured":"PACE Challenge 2021: Benchmark for Heuristic Track, https:\/\/pacechallenge.org\/2021\/tracks\/#benchmark-for-heuristic-track (2021)"},{"key":"725_CR24","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The Network Data Repository with Interactive Graph Analytics and Visualization, https:\/\/networkrepository.com\/index.php (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"725_CR25","volume-title":"METIS: a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices","author":"G Karypis","year":"1997","unstructured":"Karypis, G., Kumar, V.: METIS: a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. Army HPC Research Center, Minneapolis (1997)"},{"issue":"10","key":"725_CR26","doi-asserted-by":"publisher","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 2008(10), 10008 (2008)","journal-title":"J. Stat. Mech. Theor. Exp."},{"key":"725_CR27","unstructured":"KarypisLab: METIS - A Software Package for Graph Partitioning and Sparse Matrix Ordering, https:\/\/github.com\/KarypisLab\/METIS"},{"key":"725_CR28","unstructured":"Community Detection Resources: Community Detection Resources and Tools, https:\/\/sites.google.com\/site\/findcommunities\/"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00725-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00725-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00725-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:26:06Z","timestamp":1767968766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00725-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,18]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["725"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00725-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,18]]},"assertion":[{"value":"23 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2025","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"In article PDF, the spacing error in last paragraph of Section 3 has been corrected.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}