Exact computation of Steiner minimal trees in the plane
From MaRDI portal
Publication:1076029
DOI10.1016/0020-0190(86)90062-1zbMath0593.05022OpenAlexW2029791926MaRDI QIDQ1076029
E. J. Cockayne, Denton E. Hewgill
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90062-1
Trees (05C05) Triple systems (05B07) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Fast heuristic algorithms for rectilinear Steiner trees, O(n log n)-average-time algorithm for shortest network under a given topology, A primer of the Euclidean Steiner problem, How to find Steiner minimal trees in Euclidean \(d\)-space, Improved computation of plane Steiner minimal trees, An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space, A heuristic for Euclidean and rectilinear Steiner problems, A neural network for the Steiner minimal tree problem
Cites Work
- Unnamed Item
- Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
- On the Problem of Steiner
- An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
- The Complexity of Computing Steiner Minimal Trees
- On the Efficiency of the Algorithm for Steiner Minimal Trees
