R12.3 General-Purpose Routing
[Akers 1967] S.B. Akers, A modification of Lee's path connection algorithm IEEE Trans. on Electronic Computers 16 1 February 1967, 97-98
[Clow 1984] G.W. Clow, A global routing algorithm for general cells Proc. ACM/IEEE Design Automation Conf. June 1984, 45-51
[Hadlock 1977] F.O. Hadlock, A shortest path algorithm for grid graphs Networks 7 4 Winter, 1977, 323-334
[Hart 1968] P.E. Hart, N.J. Nilsson, B. Raphael, A formal basis for the heuristic determination of minimum cost paths IEEE Trans. on Systems Science and Cybernetics 4 2 July 1968, 100-107
[Hightower 1969] D. Hightower, A solution to line routing problems on the continuous plane Proc. ACM/IEEE Design Automation Conf. June 1969, 1-24
[Lee 1961] C.Y. ...
Get Electronic Design Automation now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
