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
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15413/
Dirks, Jona ;
Grobler, Mario ;
Rabinovich, Roman ;
Schnaubelt, Yannik ;
Siebertz, Sebastian ;
Sonneborn, Maximilian
PACE Solver Description: PACA-JAVA
Abstract
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
@InProceedings{dirks_et_al:LIPIcs.IPEC.2021.30,
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 = {https://drops.dagstuhl.de/opus/volltexte/2021/15413},
URN = {urn:nbn:de:0030-drops-154138},
doi = {10.4230/LIPIcs.IPEC.2021.30},
annote = {Keywords: Cluster editing, parameterized complexity, PACE 2021}
}
