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

arxiv: 0810.1851 · v1 · submitted 2008-10-10 · 💻 cs.CC · cs.DM· cs.DS

Piotr Berman , Marek Karpinski , Alex Zelikovsky This is my paper

classification 💻 cs.CC cs.DMcs.DS

keywords problemalgorithmapproximationdistancessteinertreebestbound

0 comments

read the original 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.

This paper has not been read by Pith yet.