Using structured steiner trees for hierarchical global routing

References

• Ancona , M. , De Floriani , L. and Deogun , J. S. 1986 . Path Problems in Structured Graphs . The Computer Journal , 29 ( 6 ) : 553 – 563 .
   Web of Science ®Google Scholar
• Ancona , M. , Clematis , A. , De Floriani , L. and Puppo , E. 1987 . Proceedings CompEuro 87, VLSI and Computers . A Hierarchical Data Structure for Hardware System Description . May 11-15 1987 , Hamburg. pp. 258 – 261 .
   Google Scholar
• Ancona M. Bruzzone E. De Floriani L. Minimal Steiner Trees in Structured Graphs Institute for Applied Mathematics September 1988 Technical Report N.42/88
   Google Scholar
• Ancona , M. , De Floriani , L. and Deogun , J. S. 1990 . Structured Spanning Trees . The Computer Journal , 33 ( 4 ) May
   Web of Science ®Google Scholar
• Balakrishnan , A. and Patel , R. 1987 . Problem Reduction Methods and a Tree Generation Algorithm for the Steiner Network Problem . Networks , 17 May : 65 – 85 .
   Google Scholar
• Burstein , M. and Pelavin , R. 1983 . Hierarchical Wire Routing . IEEE Trans. Computer-Aided Design , CAD-2 ( N0. 4 ) October : 223 – 234 .
   Google Scholar
• Cockayne , E. J. 1970 . On the Efficiency of the Algorithm for Steiner Minimal Trees . SIAMJ. Appl. Math. , 18 October : 150 – 159 .
   Web of Science ®Google Scholar
• Cockayne , E. J. and Schiller , D. G. 1972 . “ Computation of Steiner Minimal Trees ” . In Combinatorics Edited by: Welsh , D. J. A. and Woddall , D. R. 52 – 71 . Inst. of Math. and Its Appl
   Google Scholar
• Dreyfus , S. E. and Wagner , R. A. 1971 . The Steiner Problem in Graphs . Networks , 1 October : 195 – 207 .
   Google Scholar
• Foulds , L. R. and Rayward-Smith , V. J. 1983 . Steiner Problem in Graph: Algorithms and Application . Engineering Optimization , 7 October : 7 – 16 .
   Web of Science ®Google Scholar
• Garey , M. R. , Graham , R. L. and Johnson , D. S. 1977 . The Complexity of Computing Steiner Minimal Trees . SIAM J. Appl. Math. , 32 October : 835 – 859 .
   Web of Science ®Google Scholar
• Hakimi , S. L. 1971 . Steiner's Problem in Graphs and its Implications . Networks , 1 October : 113 – 133 .
   Google Scholar
• Harary , F. 1969 . Graph Theory , Reading, Mass : Addison-Wesley .
   Google Scholar
• Kou , L. , Markowsky , G. and Berman , L. 1981 . A Fast Algorithm for Steiner Tree . Acta Informatica , 15 : 141 – 145 .
   Web of Science ®Google Scholar
• Kuh , E. S. and Marek-Sadowska , M. 1986 . “ Global Routing ” . In Layout Design and Verification , Edited by: Ohtsuki , T. 169 – 198 . North-Holland .
   Google Scholar
• Lawler , E. L. 1976 . Combinatorial Optimization: Networks and Matroids , New York : Holt, Rinehart and Winston .
   Google Scholar
• Lengauer , T. 1986 . Proceedings STACS86 . Efficient Algorithm for Finding Minimum Spanning Forests of Hierarchically Defined Graphs . 1986 . pp. 153 – 170 . Springer . Lecture Notes in Computer Science N.210
   Google Scholar
• Lengauer , T. 1986 . Proceedings AWOC86 . Exploiting Hierarchies in VLSI Design . 1986 . pp. 180 – 193 . Springer . Lecture Notes in Computer Science N.227
   Google Scholar
• Levin , A. J. 1971 . Algorithm for the Shortest Connection of a Group of Graph Vertices . Soviet Math. Dokl. , 12 : 1477 – 1481 .
   Google Scholar
• Li , J. T. and Marek-Sadowska , M. 1984 . Global Routing for Gate Array . IEEE Trans. Computer- Aided Design , CAD-3 ( 4 ) October
   Google Scholar
• Luk , W. K. , Sipala , P. , Tamminen , M. , Tang , D. , Woo , L. S. and Wong , C. K. 1987 . A. Hierarchical Global Wiring Algorithm for Custom Chip Design . IEEE Trans. Computer-Aided Design , CAD-6 ( 4 ) July : 518 – 532 .
   Web of Science ®Google Scholar
• Pavan A. Experimenting Algorithms for the Steiner Problem in Structured Graphs University of Genoa 1989 Thesis
   Google Scholar
• Plesnik , J. 1981 . A Bound for the Steiner Tree Problem in Graphs . Math. Slovaca , 31 155 – 163 .
   Google Scholar
• Preas B. T. Placement and Routing Algorithms for Hierarchical Integrated Circuit Layout Stanford University 1979 Ph. D. Thesis
   Google Scholar
• Rayward-Smith , V. J. 1983 . The Computation of Nearly Minimal Steiner Trees in Graphs . Int. J. Math. Educ. Sci. Technol. , 14 15 – 23 .
   Google Scholar
• Takahashi , H. and Matsuyama , A. 1980 . An Approximate Solution for the Steiner Problem in Graphs . Math. Japonica , 24 573 – 577 .
   Google Scholar
• Ting , B. S. and Tien , D. N. 1983 . Routing Techniques for Gate Arrays . IEEE Trans. Computer-Aided Design , CAD-2 301 – 312 .
   Google Scholar
• Winter , P. 1987 . Steiner Problem in Networks: A Survey . Networks , 17 129 – 167 .
   Web of Science ®Google Scholar