The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1989 vol.38)
pp: 603-608
ABSTRACT
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
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
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool