论文信息 - Suboptimal algorithm for a wire routing problem

Suboptimal algorithm for a wire routing problem

The wire routing problem in the layout of integrated circuits is formulated as Steiner's problem in graphs. A suboptimal algorithm is described for the problem. The algorithm is based on the branch-and-bound method. The result of the algorithm applied to several examples is also described.

O. Wing | Y. Yang

[1] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

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

[3] S. Louis Hakimi,et al. Steiner's problem in graphs and its implications , 1971, Networks.

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

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