A duality based 2-approximation algorithm for maximum agreement forest - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Mathematical Programming Année : 2022

A duality based 2-approximation algorithm for maximum agreement forest

Résumé

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.
Fichier principal
Vignette du fichier
Olver2022_Article_ADualityBased2-approximationAl.pdf (758.55 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03671089 , version 1 (18-05-2022)

Identifiants

Citer

Neil Olver, Frans Schalekamp, Suzanne van Der Ster, Leen Stougie, Anke van Zuylen. A duality based 2-approximation algorithm for maximum agreement forest. Mathematical Programming, 2022, ⟨10.1007/s10107-022-01790-y⟩. ⟨hal-03671089⟩
40 Consultations
38 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More