Improved Approximations for the Steiner Tree Problem
From MaRDI portal
Recommendations
Cited in
(68)- Combinatorial optimization in system configuration design
- Approximation algorithms for constrained generalized tree alignment problem
- Improved computation of plane Steiner minimal trees
- On the approximability of the Steiner tree problem in phylogeny
- An efficient approximation algorithm for the survivable network design problem
- Faster approximation algorithms for the rectilinear Steiner tree problem
- New approximation algorithms for the Steiner tree problems
- On the approximability of the Steiner tree problem.
- Differential approximation results for the Steiner tree problem
- Recent results on approximating the Steiner tree problem and its generalizations
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
- Improved upper bounds for the Steiner ratio
- Approximating Steiner trees and forests with minimum number of Steiner points
- Local search for the Steiner tree problem in the Euclidean plane
- Steiner trees in uniformly quasi-bipartite graphs.
- On the terminal Steiner tree problem.
- The General Steiner Tree-Star problem.
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- On greedy heuristic for Steiner minimum trees
- Improved Steiner tree algorithms for bounded treewidth
- Approximations for node-weighted Steiner tree in unit disk graphs
- Stronger MIP formulations for the Steiner forest problem
- An improved algorithm for the Steiner tree problem with bounded edge-length
- A computational study on the maximum-weight bounded-degree rooted tree problem
- Bottleneck Steiner tree with bounded number of Steiner vertices
- The Euclidean bottleneck full Steiner tree problem
- Maximum series-parallel subgraph
- Cache placement in sensor networks under an update cost constraint
- Multi-rooted greedy approximation of directed Steiner trees with applications
- Parameterized study of Steiner tree on unit disk graphs
- Combination algorithms for Steiner tree variants
- Steiner points in tree metrics don't (really) help
- On the clustered Steiner tree problem
- scientific article; zbMATH DE number 5899242 (Why is no real title available?)
- On the low-dimensional Steiner minimum tree problem in Hamming metric
- Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
- A degree based approach to find Steiner trees
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- Approximating the Generalized Capacitated Tree-Routing Problem
- On the low-dimensional Steiner minimum tree problem in Hamming metric
- An approximation scheme for some Steiner tree problems in the plane
- scientific article; zbMATH DE number 1182759 (Why is no real title available?)
- scientific article; zbMATH DE number 2073988 (Why is no real title available?)
- scientific article; zbMATH DE number 2080990 (Why is no real title available?)
- scientific article; zbMATH DE number 1775442 (Why is no real title available?)
- Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
- Strong Steiner tree approximations in practice
- Subclass of the Steiner problems on a plane with rectilinear metric
- scientific article; zbMATH DE number 742979 (Why is no real title available?)
- Bounding the payment of approximate truthful mechanisms
- Definition and algorithms for reliable Steiner tree problem
- RNC-approximation algorithms for the steiner problem
- Graph-based Retrieval for Claim Verification over Cross-document Evidence
- A partition-based relaxation for Steiner trees
- Steiner shallow-light trees are exponentially lighter than spanning ones
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- scientific article; zbMATH DE number 2230205 (Why is no real title available?)
- Approximations for Steiner trees with minimum number of Steiner points
- Approximations for Steiner trees with minimum number of Steiner points
- The Clustered Selected-Internal Steiner Tree Problem
- A (1/2+1/60)-approximation algorithm for maximum weight series-parallel subgraph
- Fully dynamic algorithms for Euclidean Steiner tree
- On approximability of Steiner tree in \(\ell_p\)-metrics
- On better heuristics for Steiner minimum trees
- Node-weighted Steiner tree approximation in unit disk graphs
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
- On efficient implementation of an approximation algorithm for the Steiner tree problem
This page was built for publication: Improved Approximations for the Steiner Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4314498)
