Cut and patch Steiner trees for ladders

DOI10.1016/0012-365X(95)00275-2MaRDI QIDQ1356409zbMATH OpenFDO

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

Publication date 9 June 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(95)00275-2

zbMATH Keywords

ladderSteiner tree

Mathematics Subject Classification ID

Trees (05C05)

Review text

The authors show how to construct the Steiner minimum tree for a ladder by the cut and patch method. They prove that all intersection points between the Steiner tree and the ladder lie on two straight lines.

Recommendations

• scientific article; zbMATH DE number 3922677
• scientific article; zbMATH DE number 1099658
• Full minimal Steiner trees on lattice sets

Cites work

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

Cited in

(4)

• Efficiently solvable special cases of hard combinatorial optimization problems
• OR Utopia
• Steiner minimal trees for zigzag lines with ladders
• Steiner trees with infinitely many terminals on the sides of an angle

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356409)