1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
From MaRDI portal
Recommendations
Cites work
Cited in
(10)- Differential approximation results for the Steiner tree problem
- The General Steiner Tree-Star problem.
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
- An improved algorithm for the Steiner tree problem with bounded edge-length
- Parameterized study of Steiner tree on unit disk graphs
- A 3/2-approximation algorithm for generalized Steiner trees in complete graphs with edge lengths 1 and 2
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- APPROXIMATION ALGORITHM FOR STEINER TREE PROBLEM WITH NEIGHBOR-INDUCED COST
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
This page was built for publication: 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183443)