Steiner Trees for Ladders

DOI10.1016/S0167-5060(08)70332-7MaRDI QIDQ4163245zbMATH OpenFDO

Authors Fan Chung, Ron Graham

Publication date 1978

Published in Algorithmic Aspects of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-5060(08)70332-7

Mathematics Subject Classification ID

Trees (05C05)

Cited in

(22)

• Steiner minimal trees for regular polygons
• A primer of the Euclidean Steiner problem
• Minimal length tree networks on the unit sphere
• The role of Steiner hulls in the solution to Steiner tree problems
• Steiner minimal trees for a class of zigzag lines
• On the Steiner ratio in 3-space
• Full minimal Steiner trees on lattice sets
• Cut and patch Steiner trees for ladders
• Minimal Steiner trees for rectangular arrays of lattice points
• Efficiently solvable special cases of hard combinatorial optimization problems
• Local search for the Steiner tree problem in the Euclidean plane
• A class of full Steiner minimal trees
• On the restricted 1-Steiner tree problem
• On the restricted k-Steiner tree problem
• Minimal networks: a review
• Steiner Minimal Trees on Zig-Zag Lines
• Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds
• Steiner minimal trees for bar waves
• Steiner minimal trees for zigzag lines with ladders
• Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E^ 3
• Steiner trees with infinitely many terminals on the sides of an angle
• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)

This page was built for publication: Steiner Trees for Ladders

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