The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
From MaRDI portal
Publication:4186240
DOI10.1002/net.3230090103zbMath0401.94044OpenAlexW2075081396MaRDI QIDQ4186240
Frank K. Hwang, Fan R. K. Chung
Publication date: 1979
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230090103
Programming involving graphs or networks (90C35) Circuits, networks (94C99) Applications of graph theory to circuits and networks (94C15)
Related Items (10)
Two probabilistic results on rectilinear Steiner trees ⋮ Fast heuristic algorithms for rectilinear Steiner trees ⋮ The Steiner tree problem in orientation metrics ⋮ A probably fast, provably optimal algorithm for rectilinear Steiner trees ⋮ 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 ⋮ Some upper bounds for minimal trees ⋮ Worst-case minimum rectilinear Steiner trees in all dimensions ⋮ Worst-case ratios of networks in the rectilinear plane ⋮ Lower bounds for rectilinear Steiner trees in bounded space
Cites Work
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
