# 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} }

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

5 Citations

Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees

- Computer Science, Mathematics
- 2018

9

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 35 REFERENCES

Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees

- Computer Science, Mathematics
- 2016

8

A 3-approximation algorithm for the subtree distance between phylogenies

- Mathematics, Computer Science
- 2008

48

The maximum agreement forest problem: Approximation algorithms and computational experiments

- Mathematics, Computer Science
- 2007

39