Rectilinear Steiner Trees in Rectangle Trees

DOI10.1137/0601010zbMath0499.05024OpenAlexW2012846528MaRDI QIDQ3964590

Sandra M. Hedetniemi, Stephen T. Hedetniemi, Arthur M. Farley

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0601010

zbMATH Keywords

rectilinear Steiner tree problemminimum-distance rectangle treesrectilinear, plane C4-trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

The Steiner tree problem in orientation metrics

Cites Work

• Unnamed Item
• On Steiner Minimal Trees with Rectilinear Distance
• Rectilinear steiner trees: Efficient special-case algorithms
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• On Steiner’s Problem with Rectilinear Distance

This page was built for publication: Rectilinear Steiner Trees in Rectangle Trees