Cut and patch Steiner trees for ladders

DOI10.1016/0012-365X(95)00275-2zbMath0874.05019MaRDI QIDQ1356409

Thomas Maier, Rainer E. Burkard, Tibor Dudás

Publication date: 9 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Steiner treeladder

Mathematics Subject Classification ID

Trees (05C05)

Related Items (3)

Efficiently solvable special cases of hard combinatorial optimization problems ⋮ Steiner minimal trees for zigzag lines with ladders ⋮ OR Utopia

Cites Work

• Steiner minimal trees for bar waves
• Steiner minimal trees for regular polygons
• Steiner minimal trees on sets of four points
• A primer of the Euclidean Steiner problem
• The Steiner tree problem
• On the Problem of Steiner
• Steiner Minimal Trees on Zig-Zag Lines
• Steiner Minimal Tree for Points on a Circle
• Steiner Minimal Trees on Chinese Checkerboards
• Steiner Trees for Ladders
• The Complexity of Computing Steiner Minimal Trees
• Steiner Trees on a Checkerboard
• Steiner tree problems

This page was built for publication: Cut and patch Steiner trees for ladders