Approximating the Balanced Minimum Evolution Problem

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-417965

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.