Approximating the Balanced Minimum Evolution Problem
  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. 
Samuel Fiorini and Gwena\"el Joret
cs.DS cs.DM