Lower bounds for approximation algorithms for the Steiner tree problem
From MaRDI portal
Recommendations
- On the approximability of the Steiner tree problem
- Tighter Bounds for Graph Steiner Tree Approximation
- A lower bound for the steiner tree problem in directed graphs
- Approximations and lower bounds for the length of minimal Euclidean Steiner trees
- On approximation algorithms for the terminal Steiner tree problem
- New approximation algorithms for the Steiner tree problems
- Lower bounds for rectilinear Steiner trees in bounded space
- Approximation algorithms for the terminal Steiner tree problem
- scientific article; zbMATH DE number 139910
Cited in
(11)- Steiner trees in uniformly quasi-bipartite graphs.
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
- Approaches to the Steiner Problem in Networks
- Strong Steiner tree approximations in practice
- On the approximability of the Steiner tree problem
- scientific article; zbMATH DE number 1424548 (Why is no real title available?)
- A partition-based relaxation for Steiner trees
- Lower bounds for the relative greedy algorithm for approximating Steiner trees
- scientific article; zbMATH DE number 5042868 (Why is no real title available?)
This page was built for publication: Lower bounds for approximation algorithms for the Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448761)
