A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest

@inproceedings{Schalekamp2016ADB,
  title={A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest},
  author={Frans Schalekamp and Anke van Zuylen and Suzanne van der Ster},
  booktitle={ICALP},
  year={2016}
}
  • Frans Schalekamp, Anke van Zuylen, Suzanne van der Ster
  • Published in ICALP 2016
  • Computer Science, Mathematics
  • 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 linear programming formulation… CONTINUE READING

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 35 REFERENCES
    A New 2-Approximation Algorithm for rSPR Distance
    2
    Approximating Maximum Agreement Forest on Multiple Binary Trees
    12
    Fixed-Parameter Algorithms for Maximum Agreement Forests
    67
    Approximation Algorithms for Nonbinary Agreement Forests
    17
    On the Complexity of Comparing Evolutionary Trees
    226