
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Sarrafzadeh, D.T. Lee, "Topological Via Minimization Revisited," IEEE Transactions on Computers, vol. 40, no. 11, pp. 13071312, November, 1991.  
BibTex  x  
@article{ 10.1109/12.102839, author = {M. Sarrafzadeh and D.T. Lee}, title = {Topological Via Minimization Revisited}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {11}, issn = {00189340}, year = {1991}, pages = {13071312}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.102839}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Topological Via Minimization Revisited IS  11 SN  00189340 SP1307 EP1312 EPD  13071312 A1  M. Sarrafzadeh, A1  D.T. Lee, PY  1991 KW  topological via minimization problem; twolayer environment; twoterminal nets; bounded region; homotopy; optimal solution; twosided channel routing problem; partition number; circle graph; circuit layout CAD; graph theory. VL  40 JA  IEEE Transactions on Computers ER   
The topological via minimization problem in a twolayer environment is considered. A set of n twoterminal nets in a bounded region is given. The authors attempt to find a homotopy to assign nets to distinct layers so that no two nets on the same layer cross each other and the number of vias is minimized. A recursive approach in which an optimal solution to a twosided channel routing problem is used as a basis is used to solve this problem optimally. The notion of partition number K of a circle graph is introduced, and the total running time of the via minimization algorithm is shown to be O((n/K)/sup 2K2/ log (n/K)), where n is the total number of nets.
[1] M. J. Atallah and S. R. Kosaraju, "An efficient algorithm for maxdominance with applications,"Algorithmica, vol. 4, no. 2, pp. 221236, 1989.
[2] M. A. Buckingham, "Circle graphs," Ph.D. dissertation, Courant Instit. of Math. Sci., New York Univ., Oct. 1980.
[3] C. P. Hsu, "Minimum via topological routing,"IEEE Trans. Comput. Aided Design, vol. CAD2, pp. 235246, Oct. 1983.
[4] D. T. Lee, M. Sarrafadeh, and Y. F. Wu, "Minimum cut for circulararc graphs,"SIAM J. Comput., vol. 9, no. 6, p. 10411050, Dec. 1990.
[5] F. T. Leighton, "New lower bound technique for VLSI,"Math. Syst. Theory, vol. 17, pp. 4770, 1984.
[6] R. D. Lou, M. Sarrafzadeh, and D. T. Lee, "An optimal algorithm for the maximum twochain problem," inProc. First ACMSIAM Conf. Discrete Algorithms, San Francisco, CA, Jan. 1990; also to appear inSIAM J. Discrete Math.
[7] M. MarekSadowska, "An unconstraint topological via minimization,"IEEE Trans. Comput.Aided Design, vol. CAD3, pp. 184190, July 1984.
[8] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: SpringerVerlag, 1985.
[9] M. Sarrafzadeh and D. T. Lee, "A new approach to topological via minimization problem,"IEEE Trans. Comput.Aided Design, vol. 8, pp. 890900, Aug. 1989.
[10] X. M. Xiong, "A new algorithm for topological via minimization," inProc. ICCAD88, pp. 410413.
[11] S. Yeh and A. S. LaPaugh, "Algorithms for finding a maximum bipartite subgraph for special classes of graphs," Tech. Rep. CSTR14988, Dep. Comput. Sci., Princeton Univ., Apr. 1988.