The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter

DOI10.1002/NET.3230090103MaRDI QIDQ4186240zbMATHOpenAlexFDO

Authors Fan Chung, Frank K. Hwang

Publication date 1979

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230090103

zbMATH Keywords

Network ProgrammingLargest Minimal Rectilinear Steiner TreesSemiperimeter

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Circuits, networks (94C99) Applications of graph theory to circuits and networks (94C15)

Cites work

• On Steiner trees for bounded point sets

Cited in

(10)

• Lower bounds for rectilinear Steiner trees in bounded space
• The Steiner tree problem in orientation metrics
• Worst-case minimum rectilinear Steiner trees in all dimensions
• Some upper bounds for minimal trees
• Worst-case ratios of networks in the rectilinear plane
• A probably fast, provably optimal algorithm for rectilinear Steiner trees
• Minimum rectilinear Steiner tree of \(n\) points in the unit square
• Two probabilistic results on rectilinear Steiner trees
• Fast heuristic algorithms for rectilinear Steiner trees
• The Performance of greedy algorithms for the on-line steiner tree and related problems

This page was built for publication: The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter

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