An Improved Algorithm for Steiner Trees
From MaRDI portal
Recommendations
- An improved algorithm for computing Steiner minimal trees in Euclidean d-space
- An algorithm for the steiner problem in the euclidean plane
- Euclidean Steiner minimum trees: An improved exact algorithm
- Exact computation of Steiner minimal trees in the plane
- Two heuristics for the Euclidean Steiner tree problem
Cited in
(18)- A linear time algorithm for full Steiner trees
- A decomposition theorem on Euclidean Steiner minimal trees
- A primer of the Euclidean Steiner problem
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
- Improved Steiner tree algorithms for bounded treewidth
- Geometric conditions for Euclidean Steiner trees in R^d
- Geometry-experiment algorithm for Steiner minimal tree problem
- Approximations and lower bounds for the length of minimal Euclidean Steiner trees
- Algorithms for terminal Steiner trees
- Combination algorithms for Steiner tree variants
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
- An algorithm for the steiner problem in the euclidean plane
- Pseudo-Gilbert-Steiner trees
- scientific article; zbMATH DE number 819133 (Why is no real title available?)
- Reorganizing topologies of Steiner trees to accelerate their eliminations
- Computing and Combinatorics
- O(n log n)-average-time algorithm for shortest network under a given topology
- An improved algorithm for computing Steiner minimal trees in Euclidean d-space
This page was built for publication: An Improved Algorithm for Steiner Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474661)
