An algorithm for exact rectilinear Steiner trees for switchbox with obstacles

DOI10.1109/81.153636MaRDI QIDQ4014197zbMATH OpenOpenAlexFDO

Authors

Publication date 6 October 1992

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/81.153636

zbMATH Keywords

optimal switchbox rectilinear Steiner

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An optimal algorithm for rectilinear steiner trees for channels with obstacles
• A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets
• Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
• scientific article; zbMATH DE number 3972878
• Improved Computation of Optimal Rectilinear Steiner Minimal Trees

Cited in

(2)

• A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree
• An optimal algorithm for rectilinear steiner trees for channels with obstacles

This page was built for publication: An algorithm for exact rectilinear Steiner trees for switchbox with obstacles

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