A decomposition theorem on Euclidean Steiner minimal trees

DOI10.1007/BF02187919zbMath0659.05042OpenAlexW2085242823MaRDI QIDQ1112056

G. Y. Ting, Ding-Zhu Du, Guo-Dong Song, Frank K. Hwang

Publication date: 1988

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131057

zbMATH Keywords

decompositionSteiner minimal treeSteiner treeSMT

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Steiner polygons in the Steiner problem ⋮ A primer of the Euclidean Steiner problem ⋮ The role of Steiner hulls in the solution to Steiner tree problems ⋮ How to find Steiner minimal trees in Euclidean \(d\)-space ⋮ Improved computation of plane Steiner minimal trees ⋮ Two new criteria for finding Steiner hulls in Steiner tree problems ⋮ A neural network for the Steiner minimal tree problem

Cites Work

• Steiner minimal trees on sets of four points
• Some remarks on the Steiner problem
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees
• On the Efficiency of the Algorithm for Steiner Minimal Trees

This page was built for publication: A decomposition theorem on Euclidean Steiner minimal trees