2026-07-25T02:33:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15414 2024-03-06T10:55:42Z ddc:004 open_access

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm Bläsius, Thomas Fischbeck, Philipp Gottesbüren, Lars Hamann, Michael Heuer, Tobias Spinner, Jonas Weyand, Christopher Wilhelm, Marcus cluster editing local search variable neighborhood search The cluster editing problem is to transform an input graph into a cluster graph by performing a minimum number of edge editing operations. A cluster graph is a graph where each connected component is a clique. An edit operation can be either adding a new edge or removing an existing edge. In this write-up we outline the core techniques used in the heuristic cluster editing algorithm of the Karlsruhe and Potsdam Cluster Editing (KaPoCE) framework, submitted to the heuristic track of the 2021 PACE challenge. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Thomas Bläsius and Philipp Fischbeck and Lars Gottesbüren and Michael Hamann and Tobias Heuer and Jonas Spinner and Christopher Weyand and Marcus Wilhelm 2021 Is Part Of LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2021.31 urn:nbn:de:0030-drops-154147 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.31 eng https://creativecommons.org/licenses/by/4.0/legalcode