This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Near-Optimal Heuristic Algorithm for Single-Flow Routing
April 1989 (vol. 38 no. 4)
pp. 603-608
The authors obtain a tighter lower bound on the street congestion of optimal realizations. Then a heuristic algorithm based on necessary and sufficient conditions of optimality is proposed. Although it cannot be guaranteed that this algorithm always generates optimal realizations, it indeed generates optimal realizations for all the 60 test instances with which they experimented. This algorithm

[1] P. J. Werbos, "Back-propagation: Past and future," inProc. IEEE Int. Conf. Neural Networks. New York: IEEE Press, 1988, pp. 343-353.
[2] S. Han and S. Sahni, "A fast algorithm for single row routing," Dep. Comput. Sci., Univ. Minnesota, TR 84-5, 1984.
[3] S. Han and S. Sahni, "Single row routing in narrow streets,"IEEE Trans. Comput.-Aided Design, pp. 235-241, July 1984.
[4] E.S. Kuh et al., "On Optimum Single-row Routing,"IEEE Trans. Circuits and Systems, June 1979, pp. 361-368.
[5] R. Raghavan and S. Sahni, "Single row routing,"IEEE Trans. Comput., vol. C-32, pp. 209-220, Mar. 1983.
[6] R. Raghavan and S. Sahni, "The complexity of single-row routing,"IEEE Trans. Circuits Syst., vol. CAS-31, pp. 462-472, 1984.
[7] T.T.K. Tarng et al., "An Efficient Single-row Routing Algorithm,"IEEE Trans. CAD ICs and Systems, July 1984, pp. 178-183.
[8] B. S. Ting, E. S. Kuh, and I. Shirakawa, "The multi-layer routing problem. Algorithms and necessary and sufficient conditions for the single-row single-layer case,"IEEE Trans. Circuits Syst., vol. CAS- 23, pp. 768-778, Dec. 1976.
[9] S. Tsukiyama, E. S. Kuh, and I. Shirakawa, "An algorithm for single-row routing with prescribed street congestion,"IEEE Trans. Circuits Syst., vol. CAS-27, pp. 765-772, Sept. 1980.
[10] S. Tsukiyama and E. S. Kuh, "Double row planar routing and permutation layout,"Networks, vol. 12, pp. 286-316, 1982.

Index Terms:
near-optimal heuristic algorithm; single-flow routing; tighter lower bound; necessary and sufficient conditions; optimality; circuit layout CAD.
Citation:
L.C. Liu, H.C Du, "A Near-Optimal Heuristic Algorithm for Single-Flow Routing," IEEE Transactions on Computers, vol. 38, no. 4, pp. 603-608, April 1989, doi:10.1109/12.21154
Usage of this product signifies your acceptance of the Terms of Use.