Improved computation of plane Steiner minimal trees

DOI10.1007/BF01758759zbMath0756.05043OpenAlexW2045286914MaRDI QIDQ1186797

E. J. Cockayne, Denton E. Hewgill

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01758759

zbMATH Keywords

Euclidean planeSteiner minimal treesSteiner treecomputation

Mathematics Subject Classification ID

Trees (05C05)

Related Items (3)

On the Steiner ratio in 3-space ⋮ An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space ⋮ A neural network for the Steiner minimal tree problem

Cites Work

• A linear time algorithm for full Steiner trees
• Exact computation of Steiner minimal trees in the plane
• A decomposition theorem on Euclidean Steiner minimal trees
• The role of Steiner hulls in the solution to Steiner tree problems
• On the Problem of Steiner
• An algorithm for the steiner problem in the euclidean plane
• 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

This page was built for publication: Improved computation of plane Steiner minimal trees