A duality based 2-approximation algorithm for maximum agreement forest
Work
Year: 2022
Type: article
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 use... more
Source: Mathematical Programming
Institutions London School of Economics and Political Science, Centrum Wiskunde & Informatica, Cornell University, Vrije Universiteit Amsterdam, Université Claude Bernard Lyon 1
Cites: 29
Cited by: 8
Related to: 10
FWCI: 0.578
Citation percentile (by year/subfield): 58.44
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Life on land
Open Access status: hybrid
APC paid (est): $2,890
Funders National Science Foundation, National Science Foundation, Simons Foundation, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Grant IDS CCF-1526067, CCF-1522054, 359525, 024.002.003, 016.Vidi.189.087