,
Marcin Mennemann
,
Marius Maximilian Hille
,
Mart Hagedoorn
,
Kevin Buchin
Creative Commons Attribution 4.0 International license
A maximum agreement forest cuts a set of rooted phylogenetic trees into the fewest pieces on which all trees agree. We describe Klados (κλάδος, Ancient Greek for "branch"), our exact solver for this problem in the PACE 2026 challenge. Klados shrinks the input with safe reduction rules, including a 3-2 rule for any number of trees, and then solves the rest by branch-and-price or SAT.
@InProceedings{inhetveen_et_al:LIPIcs.IPEC.2026.35,
author = {Inhetveen, Christian and Mennemann, Marcin and Hille, Marius Maximilian and Hagedoorn, Mart and Buchin, Kevin},
title = {{PACE Solver Description: Klados - Branch-and-Price and SAT for Rooted Maximum Agreement Forests}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {35:1--35:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.35},
URN = {urn:nbn:de:0030-drops-282080},
doi = {10.4230/LIPIcs.IPEC.2026.35},
annote = {Keywords: Rooted maximum agreement forest, branch-and-price, SAT}
}
archived version
archived version