This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Two-Dimensional Via Assignment for Single-Row Routing
June 1988 (vol. 37 no. 6)
pp. 721-727
The authors study the via assignment problem when vias are allowed to appear rowwise as well as columnwise. Previously they proved that the problem belongs to the class of NP-hard problems and therefore it is unlikely that polynomial-time algorithms exist for solving the problem. Two heuristics (HEU1 and HEU2) to solve the problem were proposed. HEU1 splits the nets before any routing is done w

[1] H. So, "Some theoretical results on the routing of multi-layer printed wiring boards," inProc. IEEE 1974 Symp, Circuits Syst., pp. 296- 303.
[2] 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.
[3] B. S. Ting, E. S. Kuh, and A. Sangiovani-Vincentelly, "Via assignment problem in multi-layer printed circuit boards,"IEEE Trans. Circuit Syst., vol. CAS-26, pp. 257-272, Apr. 1979.
[4] T. F. Gonzalez, "An approximation algorithm for the multivia assignment problem,"IEEE Trans. Comput.-Aided Design, vol. CAD-3, pp. 257-264, Oct. 1984.
[5] S. Tsukiyama, I. Shirakawa, and S. Asahara, "An algorithm for the via assignment problem in backboard wiring,"IEEE Trans. Circuit Syst., vol. CAS-26, pp. 369-377, June 1979.
[6] J. Bhasker and S. Sahni, "Via Assignment in single row routing," Dep. Comput. Sci. Tech. Rep. 84-19, Univ. Minnesota, Minneapolis, MN 55455, June 1984.
[7] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[8] T. J. Schaefer, "The complexity of satisfiability problems," inTenth Anna. Symp. Theory of Comput., 1978, pp. 216-226, (with authors corrections 1988).
[9] E. L. Lawler,Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart, and Winston, 1976.
[10] R. Raghavan and S. Sahni, "The complexity of single row routing," Dep. Comput. Sci. Tech. Rep. 81-32, Univ. Minnesota, Minneapolis, MN 55455.
[11] M. T. Doreau and P. Koziol, "TWIGY--A Topological algorithm based routing system," inProc. 18th Design Automat. Conf., 1981, pp. 746-755.
[12] J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem,"Proc. Amer. Math. Soc., vol. 7, pp. 48-50, 1956.
[13] H. C. Du, O. H. Ibarra, and J. F. Naveda, "On two dimensional via assignment problem for single row routing," Dep. Comput. Sci. Department Tech. Rep. 85-27, Univ. Minnesota, Minneapolis, MN 55455.

Index Terms:
two-dimensional via assignment; single-row routing; NP-hard problems; polynomial-time algorithms; HEU1; HEU2; circuit layout CAD; directed graphs; printed circuits.
Citation:
H.C. Du, O.H. Ibarra, J.F. Naveda, "On Two-Dimensional Via Assignment for Single-Row Routing," IEEE Transactions on Computers, vol. 37, no. 6, pp. 721-727, June 1988, doi:10.1109/12.2210
Usage of this product signifies your acceptance of the Terms of Use.