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

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/171231We 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.Computational ComplexityDiscrete MathematicsData Structures and Algorithms1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Twotext