
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
JunDong Cho, Salil Raje, Majid Sarrafzadeh, "Fast Approximation Algorithms on Maxcut, kColoring, and kColor Ordering for VLSI Applications," IEEE Transactions on Computers, vol. 47, no. 11, pp. 12531266, November, 1998.  
BibTex  x  
@article{ 10.1109/12.736440, author = {JunDong Cho and Salil Raje and Majid Sarrafzadeh}, title = {Fast Approximation Algorithms on Maxcut, kColoring, and kColor Ordering for VLSI Applications}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {11}, issn = {00189340}, year = {1998}, pages = {12531266}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.736440}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Fast Approximation Algorithms on Maxcut, kColoring, and kColor Ordering for VLSI Applications IS  11 SN  00189340 SP1253 EP1266 EPD  12531266 A1  JunDong Cho, A1  Salil Raje, A1  Majid Sarrafzadeh, PY  1998 KW  VLSI partitioning KW  maximum cut KW  kColoring KW  kColor Ordering KW  approximation algorithm. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—There are a number of VLSI problems that have a common structure. We investigate such a structure that leads to a unified approach for three independent VLSI layout problems: partitioning, placement, and via minimization. Along the line, we first propose a lineartime approximation algorithm on
[1] D. Adolphson and T.C. Hu, "Optimal Linear Ordering," SIAM J. Applied Math., vol. 25, pp. 403423, 1973.
[2] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 1974.
[3] K.Y. Chao and D.F. Wong, "Layer Assignment for HighPerformance MultiChip Modules," Proc. Design Automation Conf., pp. 660685, 1994.
[4] H.H. Chen and C.K. Wong, "Wiring and Crosstalk Avoidance in MultiChip Module Design," Proc. IEEE Custom Integrated Circuits Conf., May 1992.
[5] C.K. Cheng, "Linear Placement Algorithms and Application to VLSI Design," Networks, vol. 17, pp. 439464, 1987.
[6] C.K. Cheng, X. Deng, Y.Z. Liao, and S.Z. Yao, "Symbolic Layout Compaction Under Conditional Design Rules," IEEE Trans. ComputerAided Design, vol. 11, no. 4, pp. 475486, Apr. 1992.
[7] W.T. Cheng, J.L. Lewandowski, and E. Wu, "Optimal Diagnostic Methods for Wiring Interconnects," IEEE Trans. ComputerAided Design, vol. 11, no. 9, pp. 1,1611,165, Sept. 1992.
[8] J.D. Cho, S. Raje, M. Sarrafzadeh, M. Sriram, and S.M. Kang, "Crosstalk Minimum Layer Assignment," Proc. IEEE Custom Integrated Circuits Conf., pp. 29.7.129.7.4,San Diego, Calif., 1993.
[9] P. Erdös, R. Faudee, J. Pach, and J. Spencer, "How to Make a Graph Bipartite," J. Combinatorial Theory (b), vol. 45, pp. 8698, 1988.
[10] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[11] M.R. Garey, D.S. Johnson, and L. Stockmeyer, "Some Simplified NPComplete Graph Problems," Theoretical Computer Science, vol. 1, pp. 237267, 1976.
[12] M.X. Goemans and D.P. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," Proc. Ann. ACMSIAM Symp. Theory of Computing, pp. 422431, 1994.
[13] D.J. Haglin and S.M. Venkatesan, "Approximation and Intractability Results for the Maximum Cut Problem and Its Variants," IEEE Trans. Computers, vol. 40, no. 1, pp. 110113, Jan. 1991.
[14] A. Hertz and D. de Werra, “Using Tabu Search Techniques for Graph Coloring,” Computing, vol. 39, pp. 345351, 1987.
[15] J.M. Ho, M. Sarrafzadeh, G. Vijayan, and C.K. Wong, "Layer Assignment for MultiChip Modules," IEEE Trans. ComputerAided Design, vol. 9, no. 12, pp. 1,2721,277, Dec. 1990.
[16] D.S. Johnson private communication, Bell Labs, Murray Hill, N.J., Oct. 1992.
[17] D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, "Optimization by Simulated Annealing: An Experimental Evaluation, Part II (Graph Coloring and Number Partitioning)," Operations Research, vol. 39, pp. 378406, 1991.
[18] D.A. Joy and M.J. Ciesielski, "Layer Assignment for Printed Circuit Boards and Integrated Circuits," Proc. IEEE, vol. 80, no. 2, pp. 311331, Feb. 1992.
[19] Y. Kajitani, J.D. Cho, and M. Sarrafzadeh, "New Approximation Results on Graph Matching and Related Problems," Proc. 20th Int'l Workshop, WG '94, pp. 343358,Herrsching, Germany, June 1994.
[20] S. Liu, K. Pan, and M. Pedram, "Alleviating Routing Congestion by Combining Logic Resynthesis and Linear Placement," Proc. European Design Automation Conf., pp. 578582, 1993.
[21] S. Sahni and T. Gonzales, “PComplete Approximation Problems,” J. ACM, vol. 23, pp. 555565, 1976.
[22] M. Sriram and S.M. Kang, "Detailed Layer Assignment for MCM Routing," Proc. Int'l Conf. ComputerAided Design, pp. 386389, 1992.
[23] R.S. Tsay and E.S. Kuh, "A Unified Approach to Partitioning and Placement," IEEE Trans. Circuits and Systems, vol. 38, no. 5, May 1991.
[24] H. Vaishnav and M. Pedram, "A Performance Driven Placement Algorithm for Low Power Designs," Proc. European Design Automation Conf., 1993.
[25] G. Vijayan.,"Generalization of MinCut Partitioning to Tree Structures and Its Applications," IEEE Trans. Computers, vol. 40, no. 3, Mar. 1991.
[26] P.M.B. Vitányi, "How Well Can a Graph Be nColored?" Discrete Math., vol. 34, pp. 6980, 1981.
[27] M. Yannakakis, "EdgeDeletion Problems," SIAM J. Computing, vol. 10, pp. 297309, 1981.
[28] M. Yannakakis, "On the Approximation of Maximum Satisfiability," Proc. Third Ann. ACMSIAM Symp. Discrete Algorithms, pp. 18, 1992.