Using structured steiner trees for hierarchical global routing

DOI10.1080/00207169108803990MaRDI QIDQ3348418zbMATH OpenOpenAlexFDO

Authors Massimo Ancona, E. Bruzzone, Leila De Floriani

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

global routingSteiner problemVLSI layout

Mathematics Subject Classification ID

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

Recommendations

• The Steiner problem in graphs: topological methods of solution
• Class Steiner trees and VLSI-design
• scientific article; zbMATH DE number 4191148
• A faster approximation algorithm for the Steiner problem in graphs
• A fast and simple Steiner routing heuristic

Cites work

• A fast algorithm for Steiner trees
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• On the Efficiency of the Algorithm for Steiner Minimal 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
• Steiner's problem in graphs and its implications
• The Complexity of Computing Steiner Minimal Trees
• The computation of nearly minimal Steiner trees in graphs
• The steiner problem in graphs

This page was built for publication: Using structured steiner trees for hierarchical global routing

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