Approximating the balanced minimum evolution problem

From MaRDI portal
Publication:433835

DOI10.1016/J.ORL.2011.10.003zbMATH Open1242.90275arXiv1104.1080OpenAlexW2040026476MaRDI QIDQ433835FDOQ433835


Authors: Samuel Fiorini, Gwenaël Joret Edit this on Wikidata


Publication date: 6 July 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Abstract: We prove a strong inapproximability result for the Balanced Minimum Evolution Problem. Our proof also implies that the problem remains NP-hard even when restricted to metric instances. Furthermore, we give a MST-based 2-approximation algorithm for the problem for such instances.


Full work available at URL: https://arxiv.org/abs/1104.1080




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Approximating the balanced minimum evolution problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433835)