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

DOI10.1002/NET.3230090103zbMATH Open0401.94044OpenAlexW2075081396MaRDI QIDQ4186240FDOQ4186240

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)

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

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)