DocumentCode
1610727
Title
Hierarchical global routing through structured Steiner trees
Author
Bruzzone, Elisabetta ; De Floriani, Leila
Author_Institution
Istituto per la Matematica Applicata del Consiglio Nazionale delle Ricerche, Genova, Italy
fYear
1989
Firstpage
61
Abstract
The Steiner problem in a hierarchical graph model, called a structured graph, is defined for a specific application to the hierarchical global routing problem. Properties of minimum-cost Steiner trees in structured graphs are investigated. A top-down solution to the Steiner problem in structured graphs is defined, and an algorithm is given in order to compute such a solution (or an approximation) on the basis of existing exact or heuristic algorithms for solving the Steiner problem on graphs
Keywords
VLSI; circuit layout CAD; graph theory; Steiner problem; heuristic algorithms; hierarchical global routing problem; hierarchical graph model; minimum-cost Steiner trees; structured Steiner trees; structured graphs; top-down solution; Approximation algorithms; Heuristic algorithms; Integrated circuit interconnections; Partitioning algorithms; Process design; Routing; Shape; Steiner trees; Very large scale integration; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1989., IEEE International Symposium on
Conference_Location
Portland, OR
Type
conf
DOI
10.1109/ISCAS.1989.100292
Filename
100292
Link To Document