A duality based 2-approximation algorithm for maximum agreement forest

Authors:

Abstract
We give a 2-approximation algorithm for the Maximum Agreement Forest problem on two rooted binary trees. This NP-hard problem has been studied extensively in the past two decades, since it can be used to compute the rooted Subtree Prune-and-Regraft (rSPR) distance between two phylogenetic trees. Our algorithm is combinatorial and its running time is quadratic in the input size. To prove the approximation guarantee, we construct a feasible dual solution for a novel exponential-size linear programming formulation. In addition, we show this linear program has a smaller integrality gap than previously known formulations, and we give an equivalent compact formulation, showing that it can be solved in polynomial time.
Funding Information
  • National Science Foundation (CCF-1526067, CCF-1522054)
  • Nederlandse Organisatie voor Wetenschappelijk Onderzoek (Veni 639.071.307)
  • Simons Foundation (359525)
  • Nederlandse Organisatie voor Wetenschappelijk Onderzoek (016.Vidi.189.087, 024.002.003)

This publication has 23 references indexed in Scilit: