On Steiner trees for bounded point sets

DOI10.1007/BF00149359zbMath0475.05023MaRDI QIDQ1159677

Fan R. K. Chung, Ronald L. Graham

Publication date: 1981

Published in: Geometriae Dedicata (Search for Journal in Brave)

zbMATH Keywords

Steiner tree

Mathematics Subject Classification ID

Trees (05C05)

Related Items (18)

Greedy algorithms for the on-line steiner tree and generalized steiner problems ⋮ Two probabilistic results on rectilinear Steiner trees ⋮ Quantizers ad the worst case Euclidean traveling salesman problem ⋮ Fast heuristic algorithms for rectilinear Steiner trees ⋮ The Performance of greedy algorithms for the on-line steiner tree and related problems ⋮ Watchman tours for polygons with holes ⋮ Minimum rectilinear Steiner tree of \(n\) points in the unit square ⋮ Some upper bounds for minimal trees ⋮ A primer of the Euclidean Steiner problem ⋮ The rectilinear Steiner arborescence problem ⋮ Worst-case minimum rectilinear Steiner trees in all dimensions ⋮ Worst-case ratios of networks in the rectilinear plane ⋮ The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study ⋮ Unnamed Item ⋮ Thirty‐five‐point rectilinear steiner minimal trees in a day ⋮ The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter ⋮ Lower bounds for rectilinear Steiner trees in bounded space ⋮ On the Stretch Factor of Polygonal Chains

This page was built for publication: On Steiner trees for bounded point sets