Thirty‐five‐point rectilinear steiner minimal trees in a day

DOI10.1002/net.3230250206zbMath0820.90120OpenAlexW2018752549MaRDI QIDQ4698230

Jeffrey S. Salowe, David M. Warme

Publication date: 14 May 1995

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

rectilinear Steiner minimal tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05)

Related Items (7)

Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology ⋮ The number of tree stars is \(O^{*}(1.357^k)\) ⋮ The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study ⋮ Bounding the expected number of rectilinear full Steiner trees ⋮ Computing optimal rectilinear Steiner trees: A survey and experimental evaluation ⋮ A deep-submicron Steiner tree. ⋮ Steiner's problem in double trees

Cites Work

• On Steiner trees for bounded point sets
• On the Problem of Steiner

This page was built for publication: Thirty‐five‐point rectilinear steiner minimal trees in a day