Steiner minimal trees for a class of zigzag lines

DOI10.1007/BF01758760zbMath0756.05042MaRDI QIDQ1186798

R. S. Booth, Jia Feng Weng

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

Euclidean planeSteiner minimal treesSteiner treeSteiner ratio conjectureSteiner convex zigzag lineszigzag line

Mathematics Subject Classification ID

Trees (05C05)

Related Items (6)

Variational approach and Steiner minimal trees on four points ⋮ On the Steiner ratio in 3-space ⋮ Steiner minimal trees on regular polygons with centre ⋮ A primer of the Euclidean Steiner problem ⋮ On the restricted 1-Steiner tree problem ⋮ On the restricted \(k\)-Steiner tree problem

Cites Work

• Steiner minimal trees for bar waves
• Steiner minimal trees on sets of four points
• Analytic formulas for full Steiner trees
• Some remarks on the Steiner problem
• A class of full Steiner minimal trees
• Steiner Minimal Trees on Zig-Zag Lines
• Steiner Minimal Tree for Points on a Circle
• The shortest network under a given topology
• Steiner Trees for Ladders
• The Complexity of Computing Steiner Minimal Trees
• Steiner Trees on a Checkerboard
• Steiner Minimal Trees
• On the Efficiency of the Algorithm for Steiner Minimal Trees
• Steiner’s problem for set-terminals

This page was built for publication: Steiner minimal trees for a class of zigzag lines