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

2008/12/11 by Piotr Berman, Berman, Piotr, Marek Karpiński +3
Computer Science · Engineering · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #VLSI and FPGA Design Techniques

paper · pdf · doi:10.48550/arxiv.0812.2137

openalex publication_date 2008/12/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We 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.

Related

• 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
• A simple approximation algorithm for the internal Steiner minimum tree
• A PTAS for the Steiner Forest Problem in Doubling Metrics
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem