Steiner Trees for Ladders

DOI10.1016/S0167-5060(08)70332-7zbMath0384.05030MaRDI QIDQ4163245

Ronald L. Graham, Fan R. K. Chung

Publication date: 1978

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

Mathematics Subject Classification ID

Trees (05C05)

Related Items

Steiner minimal trees for regular polygons, 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, Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds, Minimal Networks: A Review, Steiner Minimal Trees on Zig-Zag Lines, 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, Steiner minimal trees for zigzag lines with ladders, On the restricted 1-Steiner tree problem, Steiner minimal trees for bar waves, Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\), Local search for the Steiner tree problem in the Euclidean plane, A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\), A class of full Steiner minimal trees, On the restricted \(k\)-Steiner tree problem