A linear time algorithm for full Steiner trees
From MaRDI portal
Publication:1068839
DOI10.1016/0167-6377(86)90008-8zbMath0582.05022OpenAlexW2021517364MaRDI QIDQ1068839
Publication date: 1986
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(86)90008-8
Related Items (23)
Hexagonal coordinate systems and Steiner minimal trees ⋮ Rotationally optimal spanning and Steiner trees in uniform orientation metrics ⋮ A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ ⋮ Upper and lower bounds for the lengths of Steiner trees in 3-space ⋮ GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM ⋮ Approximate Euclidean Steiner trees ⋮ Fast heuristic algorithms for rectilinear Steiner trees ⋮ O(n log n)-average-time algorithm for shortest network under a given topology ⋮ Geometry and topology of local minimal 2-trees ⋮ A primer of the Euclidean Steiner problem ⋮ On the structure and complexity of the 2-connected Steiner network problem in the plane ⋮ 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 ⋮ The full Steiner tree problem ⋮ Local search for the Steiner tree problem in the Euclidean plane ⋮ Modeling of optimal networks by means of linkages ⋮ A multivariate analysis of the strict terminal connection problem ⋮ Insight into the computation of Steiner minimal trees in Euclidean space of general dimension ⋮ Fixed topology Steiner trees and spanning forests ⋮ On the location of Steiner points in uniformly-oriented Steiner trees. ⋮ Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
Cites Work
This page was built for publication: A linear time algorithm for full Steiner trees
