论文信息 - Use of steiner's problem in suboptimal routing in rectilinear metric

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 randomly generated examples indicates feasibility of fast CPU execution time and good quality of solution in comparison with other existing algorithms.

[1] B. A. Unger,et al. A method for rapid testing of beam crossover circuits , 1972, Design Automation Conference.

[2] R. Prim. Shortest connection networks and some generalizations , 1957 .

[3] D. Lynn. Computer-Aided Layout System for Integrated Circuits , 1971 .

[4] O. Wing,et al. Suboptimal algorithm for a wire routing problem , 1972 .

[5] Roland L. Mattison. A high quality, low cost router for MOS/LSI , 1972, DAC '72.

[6] H. Pollak,et al. Steiner Minimal Trees , 1968 .

[7] Alfred V. Aho,et al. Rectilinear steiner trees: Efficient special-case algorithms , 1977, Networks.

[8] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[9] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.

[10] O. Wing,et al. On a multinet wiring problem , 1973 .

[11] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .

[12] J. Geyer. Connection Routing Algorithm for Printed Circuit Boards , 1971 .

[13] F. Hwang. On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[14] M. Hanan. A Counterexample to a Theorem of Fu on Steiner's Problem , 1972 .