1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two

Details 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two

2008-10-10

arxiv.org/abs/0810.1851v1

Computer Science

Computational Complexity

Scientific paper

We give a 1.25 approximation algorithm for the Steiner Tree Problem with
distances one and two, improving on the best known bound for that problem.

Affiliated with

Also associated with

No associations

Rating

1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two 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 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527121