Rectilinear Steiner Trees in Rectangle Trees

DOI10.1137/0601010zbMATH Open0499.05024OpenAlexW2012846528MaRDI QIDQ3964590FDOQ3964590

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

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)

Cites Work

• The Rectilinear Steiner Tree Problem is $NP$-Complete
• On Steiner Minimal Trees with Rectilinear Distance
• On Steiner’s Problem with Rectilinear Distance
• Title not available (Why is that?)
• Rectilinear steiner trees: Efficient special-case algorithms

Cited In (1)

• The Steiner tree problem in orientation metrics

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

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