License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2021.30
URN: urn:nbn:de:0030-drops-154138
Go to the corresponding LIPIcs Volume Portal

Dirks, Jona ; Grobler, Mario ; Rabinovich, Roman ; Schnaubelt, Yannik ; Siebertz, Sebastian ; Sonneborn, Maximilian

PACE Solver Description: PACA-JAVA

LIPIcs-IPEC-2021-30.pdf (0.4 MB)


We describe PACA-JAVA, an algorithm for solving the cluster editing problem submitted for the exact track of the Parameterized Algorithms and Computational Experiments challenge (PACE) in 2021. The algorithm solves the cluster editing problem by applying data-reduction rules, performing a layout heuristic, local search, iterative ILP verification, and branch-and-bound. We implemented the algorithm in the scope of a student project at the University of Bremen.

BibTeX - Entry

  author =	{Dirks, Jona and Grobler, Mario and Rabinovich, Roman and Schnaubelt, Yannik and Siebertz, Sebastian and Sonneborn, Maximilian},
  title =	{{PACE Solver Description: PACA-JAVA}},
  booktitle =	{16th International Symposium on Parameterized and Exact Computation (IPEC 2021)},
  pages =	{30:1--30:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-216-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{214},
  editor =	{Golovach, Petr A. and Zehavi, Meirav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-154138},
  doi =		{10.4230/LIPIcs.IPEC.2021.30},
  annote =	{Keywords: Cluster editing, parameterized complexity, PACE 2021}

Keywords: Cluster editing, parameterized complexity, PACE 2021
Collection: 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Issue Date: 2021
Date of publication: 22.11.2021
Supplementary Material: Software:
Software (Gitlab Repository):

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI