PACE Solver Description: PACA-JAVA

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.

Subjects

Cluster editing

;

parameterized complexity

;

PACE 2021

Publisher

Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Institution

Universität Bremen

Type

conference paper

Journal/Edited collection

16th International Symposium on Parameterized and Exact Computation (IPEC 2021) = Leibniz International Proceedings in Informatics (LIPIcs), Band 214

Start page

30:1

End page

30:4

Secondary publication

Yes

Document version

Published Version

License

https://creativecommons.org/licenses/by/4.0/

Language

English

File(s)

Download

Name

Dirks et al_PACE Solver Description_PACA-JAVA_2021_published-version.pdf

Size

819.69 KB

Format

Adobe PDF

Checksum

(MD5):eacad3bb08c6d5c35a39aec115cef3eb