Computer Science – Data Structures and Algorithms
Scientific paper
2011-04-06
Operations Research Letters, 40/1:31--35, 2012
Computer Science
Data Structures and Algorithms
Scientific paper
10.1016/j.orl.2011.10.003
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.
Fiorini Samuel
Joret Gwenaël
No associations
LandOfFree
Approximating the Balanced Minimum Evolution Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximating the Balanced Minimum Evolution Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating the Balanced Minimum Evolution Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-417965