2008/10/10 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.0810.1851
openalex publication_date 2008/10/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.