> Details

Bläsius, Thomas [Author]; Fischbeck, Philipp [Author]; Gottesbüren, Lars [Author]; Hamann, Michael [Author]; Heuer, Tobias [Author]; Spinner, Jonas [Author]; Weyand, Christopher [Author]; Wilhelm, Marcus [Author] ; 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 [Contributor]

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm
  • Contributor: Bläsius, Thomas [Author]; Fischbeck, Philipp [Author]; Gottesbüren, Lars [Author]; Hamann, Michael [Author]; Heuer, Tobias [Author]; Spinner, Jonas [Author]; Weyand, Christopher [Author]; Wilhelm, Marcus [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.IPEC.2021.31
  • Keywords: variable neighborhood search ; local search ; cluster editing
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: 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.
  • Access State: Open Access