On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published in Discrete Applied Mathematics

Scientific paper

10.1016/j.dam.2008.06.007

This paper has been withdrawn by the corresponding author because the newest
version is now published in Discrete Applied Mathematics.

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

On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems 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 On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-647002

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