,
Enrico Iurlano
,
Hai Xia
Creative Commons Attribution 4.0 International license
We describe woodcutter, our solver for the Parameterized Algorithms and Computational Experiments (PACE) challenge of 2026 involving the (rooted and binary) Maximum Agreement Forest (MAF) problem. The solver’s core is an exact branch-cut-and-price procedure over a set-packing formulation whose columns are agreement subtrees. Columns are generated by solving a weighted variant of the Maximum Agreement Subtree problem on the internal vertices of the input trees, and the linear programming bound is strengthened by clique cuts and closed by branching. This branch-cut-and-price procedure is preceded by reduction rules and a cluster decomposition.
@InProceedings{varga_et_al:LIPIcs.IPEC.2026.34,
author = {Varga, Johannes and Iurlano, Enrico and Xia, Hai},
title = {{PACE Solver Description: Woodcutter, a Branch-Cut-And-Price Algorithm Computing Maximum Agreement Forests}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {34:1--34:4},
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.34},
URN = {urn:nbn:de:0030-drops-282071},
doi = {10.4230/LIPIcs.IPEC.2026.34},
annote = {Keywords: Maximum Agreement Forest, Phylogenetics, Branch-and-Price, Column Generation, PACE Challenge}
}
archived version