Approximating the Balanced Minimum Evolution Problem
Data Structures and Algorithms
2012-01-31 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1104.1080,
title = {Approximating the Balanced Minimum Evolution Problem},
author = {Samuel Fiorini and Gwenaël Joret},
journal= {arXiv preprint arXiv:1104.1080},
year = {2012}
}