A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two

Details A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two

2008-12-11

arxiv.org/abs/0812.2137v1

Computer Science

Computational Complexity

Scientific paper

We design a 3/2 approximation algorithm for the Generalized Steiner Tree
problem (GST) in metrics with distances 1 and 2. This is the first polynomial
time approximation algorithm for a wide class of non-geometric metric GST
instances with approximation factor below 2.

Affiliated with

Also associated with

No associations

Rating

A Factor 3/2 Approximation for Generalized 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 A Factor 3/2 Approximation for Generalized 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 A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60703