Use of Steiner's problem in suboptimal routing in rectilinear metric

Using known results in Steiner's problem, suboptimal algorithms are advanced for routing single nets subject to the minimum length constraint and multinets subject to the minimum length and maximum allowable channel capacity constraints. Implementation of the algorithm on a large number of rand...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems Vol. 23; no. 7; pp. 470 - 476
Main Authors Lee, J., Bose, N., Hwang, F.
Format Journal Article
LanguageEnglish
Published IEEE 01.01.1976
Subjects
Channel capacity
Conducting materials
Conductors
Euclidean distance
Integrated circuit layout
Joining processes
Random number generation
Routing
Steiner trees
Wiring
Online AccessGet full text
ISSN0098-4094
DOI10.1109/TCS.1976.1084243

Cover

More Information
Summary:Using known results in Steiner's problem, suboptimal algorithms are advanced for routing single nets subject to the minimum length constraint and multinets subject to the minimum length and maximum allowable channel capacity constraints. Implementation of the algorithm on a large number of randomly generated examples indicates feasibility of fast CPU execution time and good quality of solution in comparison with other existing algorithms.
ISSN:0098-4094
DOI:10.1109/TCS.1976.1084243