Under the auspices of the Computational Complexity Foundation (CCF)
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.
