Recognition: unknown
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
classification
💻 cs.CC
cs.DMcs.DS
keywords
problemalgorithmapproximationdistancessteinertreebestbound
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.