A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/210403We design a 3/2 approximation algorithm for the Generalized Steiner Tree problem (GST) in metrics with distances 1 and 2. This is the first polynomial time approximation algorithm for a wide class of non-geometric metric GST instances with approximation factor below 2.Computational ComplexityDiscrete MathematicsData Structures and AlgorithmsA Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Twotext