
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K.C. Chang, H.C. Du, "Layer Assignment Problem for ThreeLayer Routing," IEEE Transactions on Computers, vol. 37, no. 5, pp. 625632, May, 1988.  
BibTex  x  
@article{ 10.1109/12.4616, author = {K.C. Chang and H.C. Du}, title = {Layer Assignment Problem for ThreeLayer Routing}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {5}, issn = {00189340}, year = {1988}, pages = {625632}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.4616}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Layer Assignment Problem for ThreeLayer Routing IS  5 SN  00189340 SP625 EP632 EPD  625632 A1  K.C. Chang, A1  H.C. Du, PY  1988 KW  threelayer routing; layer assignment; signal nets; constrained via minimization; CVM3; NPcomplete; heuristic algorithm; circuit layout CAD; computational complexity; heuristic programming; minimisation; VLSI. VL  37 JA  IEEE Transactions on Computers ER   
[1] A. Hashimoto and J. Stevens, "Wire routing by optimizing channel assignment within large apertures," inProc. Design Automat. Workshop, 1971, pp. 155169.
[2] M. Servit, "Minimizing the number of feedthroughs in twolayer printed boards,"Digital Processes, vol. 3, pp. 177183.
[3] K. R. Stevens and W. M. VanCleemput, "Global via elimination in generalized routing environment," inProc. 1979 ISCAS, pp. 689 692.
[4] Y. Kajitani, "On via hole minimization of routing in a 2layer board," inProc. IEEE 1980 Int. Conf. Circuits Comput., June 1980, pp. 295298.
[5] F. Hadlock, "Finding a maximum cut of a planar graph in polynomial time,"SIAM Comput., vol. 4, pp. 221225, Sept. 1975.
[6] M. J. Ciesielski and E. Kinnen, "An optimum layer assignment for routing in ICs and PCBs," inProc. 18th Design Automat. Conf., June 1981, pp. 733737.
[7] R. W. Chen, Y. Kajitani, and S. P. Chan, "On the via minimization problem for the twolayer printed circuit board," inConf. Rec. 15th Asilomar Conf. Circuits, Syst., Comput., 1981, pp. 2226.
[8] R. W. Chen, Y. Kajitani, and S. P. Chan, "Topological considerations of the via minimization problem for twolayer PC board," inProc. ISCAS, 1982, pp. 968971.
[9] R. Chen, Y. Kajitani, and S. Chan, "A graph theoretic via minimization algorithm for two layer printed circuit boards,"IEEE Trans. Circuit Syst., pp. 284299, 1983.
[10] R. Y. Pinter, "Optimal layer assignment for interconnect," inProc. ISCAS, 1982, pp. 398401.
[11] D. T. Lee, S. J. Hong, and C. K. Wong, "Number of vias: A control parameter for global wiring of highdensity chips,"IBM J. Res. Develop., vol. 25, pp. 261271, July 1981.
[12] H. C. Du and K. C. Chang, "A new approach for layer assignment problem," Tech. Rep. TR8420, Dep. Comput. Sci., Univ. Minnesota, Minneapolis, MN, 1984.
[13] K. Chang and D. Du, "Efficient algorithms for the layer assignment problem,"IEEE Trans. Comput.Aided Design, vol. CAD6, pp. 6778, 1987.
[14] C. P. Hsu, "Minimum via topological routing,"IEEE Trans. Comput. Aided Design, vol. CAD2, pp. 235246, Oct. 1983.
[15] M. MarekSadowska, "An unconstraint topological via minimization,"IEEE Trans. Comput.Aided Design, vol. CAD3, pp. 184190, July 1984.
[16] Y. K. Chen and M. L. Liu, "Threelayer channel routing,"IEEE Trans. Comput.Aided Design, vol. CAD3, pp. 156163, Apr. 1984.
[17] S. E. Hambrusch, "Channel routing algorithms for overlap models,"IEEE Trans. Comput.Aided Design, vol. CAD4, pp. 2330, Jan. 1985.
[18] N. Deo,Graph Theory with Application to Engineering and Computer Science. Englewood Cliffs, NJ: PrenticeHall, 1974.
[19] M. R. Garey and D. S. Johnson,Computers and Intractability. San Francisco, CA: Freeman, 1979.
[20] R. Srinivasan and I. M. Patnaik, "Two algorithms for threelayer channel routing,"IEEE Trans. Comput.Aided Design, vol. CAD 16, pp. 264271, Sept. 1984.
[21] M. R. Garey and D. S. Johnson, "The complexity of nearoptimal graph coloring,"J. ACM, vol. 23, pp. 4349, Jan. 1976.
[22] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[23] K. C. Chang and H. C. Du, "Layer assignment problem for threelayer routing," TR 8533, Dep. Comput. Sci., Univ. Minnesota, Minneapolis, MN 55455.