Abstract
This document describes our exact solver "ADE" for the unweighted cluster editing problem submitted to the PACE 2021 competition. The solver’s core consists of an FPT-algorithm using a branch and bound strategy in conjunction with several data reduction rules.
BibTeX - Entry
@InProceedings{bille_et_al:LIPIcs.IPEC.2021.28,
author = {Bille, Alexander and Brandenstein, Dominik and Herrendorf, Emanuel},
title = {{PACE Solver Description: ADE-Solver}},
booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)},
pages = {28:1--28: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/15411},
URN = {urn:nbn:de:0030-drops-154112},
doi = {10.4230/LIPIcs.IPEC.2021.28},
annote = {Keywords: Unweighted Cluster Editing}
}