A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
<|reference_start|>A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees: We present a simple 4-approximation algorithm for computing a maximum agreement forest of multiple unrooted binary trees. This algorithm applies LP rounding to an extension of a recent ILP formulation of the maximum agreement forest problem on two trees by Van Wersch al. We achieve the same approximation ratio as the algorithm of Chen et al. but our algorithm is extremely simple. We also prove that no algorithm based on the ILP formulation by Van Wersch et al. can achieve an approximation ratio of $4 - \varepsilon$, for any $\varepsilon > 0$, even on two trees. To this end, we prove that the integrality gap of the ILP approaches 4 as the size of the two input trees grows.<|reference_end|>
@article{dempsey2024a,
    title={A Simple 4-Approximation Algorithm for Maximum Agreement Forests on
  Multiple Unrooted Binary Trees},
    author={Jordan Dempsey, Leo van Iersel, Mark Jones and Norbert Zeh},
    journal={arXiv preprint arXiv:2409.08440},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.08440},
    primaryClass={cs.DS}
}