Approximating the maximum agreement forest on \(k\) trees
From MaRDI portal
Publication:835040
DOI10.1016/j.ipl.2004.11.004zbMath1173.68601OpenAlexW2038369566MaRDI QIDQ835040
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.11.004
Related Items (7)
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees ⋮ A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees ⋮ A duality based 2-approximation algorithm for maximum agreement forest ⋮ Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees ⋮ Approximating maximum agreement forest on multiple binary trees ⋮ Algorithms for parameterized maximum agreement forest problem on multiple trees ⋮ The maximum agreement forest problem: Approximation algorithms and computational experiments
Cites Work
This page was built for publication: Approximating the maximum agreement forest on \(k\) trees