A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
Piotr Berman, Marek Karpinski, Alex Zelikovsky
TL;DR
This paper presents the first polynomial-time 3/2 approximation algorithm for the Generalized Steiner Tree problem in metrics with distances 1 and 2, improving upon the previous approximation factor of 2 for this class.
Contribution
The authors develop a novel 3/2 approximation algorithm for GST in metrics with distances 1 and 2, expanding the range of efficiently solvable instances.
Findings
Achieved a 3/2 approximation ratio for GST with distances 1 and 2
First polynomial-time algorithm with approximation factor below 2 for this class
Demonstrated effectiveness on non-geometric metric instances
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVLSI and FPGA Design Techniques · Complexity and Algorithms in Graphs · Computational Geometry and Mesh Generation