An optimal algorithm for rectilinear steiner trees for channels with obstacles

DOI10.1002/cta.4490190604zbMath0793.68112OpenAlexW1966011265WikidataQ126239288 ScholiaQ126239288MaRDI QIDQ3985984

No author found.

Publication date: 27 June 1992

Published in: International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cta.4490190604

zbMATH Keywords

channel rectilinear Steiner tree problem

Mathematics Subject Classification ID

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

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Rectilinear shortest paths in the presence of rectangular barriers

This page was built for publication: An optimal algorithm for rectilinear steiner trees for channels with obstacles