Using structured steiner trees for hierarchical global routing

DOI10.1080/00207169108803990zbMath0726.68039OpenAlexW2036123903MaRDI QIDQ3348418

Leila De Floriani, M. Ancona, E. Bruzzone

Publication date: 1991

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803990

zbMATH Keywords

Steiner problemVLSI layoutglobal routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Circuits, networks (94C99) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Unnamed Item
• A fast algorithm for Steiner trees
• Path Problems in Structured Graphs
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Steiner problem in networks: A survey
• The Complexity of Computing Steiner Minimal Trees
• The computation of nearly minimal Steiner trees in graphs
• On the Efficiency of the Algorithm for Steiner Minimal Trees
• Steiner's problem in graphs and its implications
• The steiner problem in graphs