TR08-094 | 10th October 2008 00:00
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
Abstract:
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.