Spanning graph-based nonrectilinear steiner tree algorithms
暂无分享,去创建一个
Hai Zhou | Qi Zhu | Xianlong Hong | Tong Jing | Yang Yang | H. Zhou | Tong Jing | Yang Yang | Xianlong Hong | Qiming Zhu
[1] Cheng-Kok Koh,et al. Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures , 2000, ACM Great Lakes Symposium on VLSI.
[2] Mary Jane Irwin,et al. An edge-based heuristic for Steiner routing , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[3] Yin Wang,et al. An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design , 2004, PATMOS.
[4] Hai Zhou,et al. Efficient Steiner tree construction based on spanning graphs , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[5] Michael Kaufmann,et al. Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem , 1993, ISAAC.
[6] Chris Coulston. Constructing exact octagonal steiner minimal trees , 2003, GLSVLSI '03.
[7] Yici Cai,et al. A novel timing-driven global routing algorithm considering coupling effects for high performance circuit design , 2003, ASP-DAC '03.
[8] Alex Zelikovsky,et al. An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.
[9] Chak-Kuen Wong,et al. Hierarchical Steiner tree construction in uniform orientations , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[10] Chak-Kuen Wong,et al. On Some Distance Problems in Fixed Orientations , 1987, SIAM J. Comput..
[11] Frank K. Hwang,et al. An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees , 1979, JACM.
[12] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[13] Andrew B. Kahng,et al. A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[14] Hai Zhou,et al. Efficient minimum spanning tree construction without Delaunay triangulation , 2002, Inf. Process. Lett..
[15] Andrew B. Kahng,et al. Highly scalable algorithms for rectilinear and octilinear Steiner trees , 2003, ASP-DAC '03.
[16] Yici Cai,et al. An efficient hierarchical timing-driven Steiner tree algorithm for global routing , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.
[17] Yici Cai,et al. UTACO: a unified timing and congestion optimization algorithm for standard cell global routing , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[18] D. T. Lee,et al. On Steiner tree problem with 45/spl deg/ routing , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.
[19] Martin D. F. Wong,et al. An efficient and optimal algorithm for simultaneous buffer and wire sizing , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[20] C. Chiang. Octilinear Steiner tree construction , 2002, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002..
[21] Yao-Wen Chang,et al. A novel framework for multilevel routing considering routability and performance , 2002, ICCAD 2002.
[22] Martin D. F. Wong,et al. An algorithm for integrated pin assignment and buffer planning , 2005, TODE.
[23] Gabriel Robins. On optimal interconnections , 1992 .
[24] Hai Zhou,et al. Efficient octilinear steiner tree construction based on spanning graphs , 2004, ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753).
[25] Chung-Kuan Cheng,et al. A global router with a theoretical bound on the optimal solution , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[26] Steven L. Teig,et al. The X architecture: not your father's diagonal wiring , 2002, SLIP '02.
[27] Andrew B. Kahng,et al. A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..