On Steiner trees for bounded point sets

DOI10.1007/BF00149359MaRDI QIDQ1159677zbMATH OpenFDO

Authors Fan Chung, Ron Graham

Publication date 1981

Published in Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00149359

zbMATH Keywords

Steiner tree

Mathematics Subject Classification ID

Trees (05C05)

Cited in

(18)

• Two probabilistic results on rectilinear Steiner trees
• Quantizers ad the worst case Euclidean traveling salesman problem
• Fast heuristic algorithms for rectilinear Steiner trees
• 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
• Minimum rectilinear Steiner tree of n points in the unit square
• Worst-case ratios of networks in the rectilinear plane
• The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
• Watchman tours for polygons with holes
• Thirty‐five‐point rectilinear steiner minimal trees in a day
• The Performance of greedy algorithms for the on-line steiner tree and related problems
• On the stretch factor of polygonal chains
• Greedy algorithms for the on-line steiner tree and generalized steiner problems
• On the stretch factor of polygonal chains
• The stretch-length tradeoff in geometric networks: average case and worst case study
• Lower bounds for rectilinear Steiner trees in bounded space

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

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