ACO-Steiner: Ant colony optimization based rectilinear Steiner minimal tree algorithm

Journal of Computer Science and Technology

Volumn 21, Issue 1, 2006, Pages 147-152

  Hu, Yu ^a,c   Jing, Tong ^a   Feng, Zhe ^a   Hong, Xian Long ^a   Hu, Xiao Dong ^b   Yan, Gui Ying ^b  

^a TSINGHUA UNIVERSITY   (China)

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

^c University of California   (United States)

Author keywords

Ant colony optimization (ACO); Physical design; Rectilinear Steiner minimal tree (RSMT); Routing

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; OPTIMIZATION; ROUTERS; TREES (MATHEMATICS);

ANT COLONY OPTIMIZATION (ACO); PHYSICAL DESIGN; RECTILINEAR STEINER MINIMAL TREE (RSMT); ROUTING;

PROBLEM SOLVING;

EID: 32144448017     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-006-0147-0     Document Type: Article

References (23)

1. Carden R C IV, Li J M, Cheng C K. A global router with a theoretical bound on the optimal solution. IEEE Trans. Computer-Aided Design, Feb. 1996, 15: 208-216.
2. Jing T, Hong X L, Bao H Y, Xu J Y, Gu J. SSTT: Efficient local search for GSI global routing. J. Computer Science and Technology, 2003, 18(5): 632-639.
3. Jing T, Hong X L, Xu J Y, Bao H Y, Cheng C K, Gu J. UTACO: A unified timing and congestion optimization algorithm for standard cell global routing. IEEE Trans. CAD, 2004, 23(3): 358-365.
4. Xiang H, Tang X P, Wong D F. An algorithm for integrated pin assignment and buffer planning. In Proc. ACM/IEEE Design Automation Conf. (DAC), 2002, pp.584-589.
5. Hong X L, Jing T, Xu J Y, Bao H Y, Gu J. CNB: A critical-network-based timing optimization method for standard cell global routing. J. Computer Science and Technology, 2003, 18(6): 732-738.
6. Xu J Y, Hong X L, Jing T, Cai Y C, Gu J. A novel timing-driven global routing algorithm considering coupling effects for high performance circuit design. IEICE Trans. Fundamentals of ECCS, 2003, E86-A(12): 3158-3167.
7. Wang Y, Hong X L, Jing T, Yang Y, Hu X D, Yan G Y. An efficient low-degree RMST algorithm for VLSI/ULSI physical design. Lecture Notes in Computer Science (LNCS)3254 - Integrated Circuits and System Design, Santorini, Greece, Sept. 2004, pp.442-452.
8. Xu J Y, Hong X L, Jing T, Gai Y C, Gu J. An efficient hierarchical timing-driven Steiner tree algorithm for global routing. INTEGRATION, VLSI J., 2003, 35(2): 69-84.
9. Garey M R, Johnson D S. The rectilinear Steiner tree problem is NP-complete. SI AM Journal on Applied Mathematics, 1977, 32: 826-834.
10. Hwang F K, Richards D S, Winter P. The Steiner Tree Problem, Annals of Discrete Mathematics. Amsterdam: North-Holland, The Netherlands, 1992.
11. Kahng A B, Robins G. A new class of iterative Steiner tree heuristics with good performance. IEEE Trans. Computer-Aided Design, July 1992, 11: 893-902,
12. Borah M, Owens R M, Irwin M J. An edge-based heuristic for Steiner routing. IEEE Trans. Computer Aided Design, 1994, 13: 1563-1568.
13. Kahng A B, Mandoiu I I, Zelikovsky A Z. Highly scalable algorithms for rectilinear and octilinear Steiner trees. In Proc. Asia and South Pacific Design Automation Conference (ASP-DAC), Kitakyushu, Japan, 2003, pp.827-833.
14. Zhou H. Efficient Steiner tree construction based on spanning graphs. In Proc. ACM ISPD, Monterey, CA, USA, 2003, pp.152-157.
15. Qi Zhu, Hai Zhou, Tong Jing, Xianlong Hong, Yang Yang. Spanning graph-based nonrectilinear Steiner tree algorithms. IEEE Trans. CAD, 2005, 24(7): 1066-1075.
16. Warme D M, Winter P, Zachariasen M. Exact algorithms for plane Steiner tree problems: A computational study. Technical Report DIKU-TR-98/11, Department of Computer Science, University of Copenhagen, April 1998.
17. Zachariasen M. Rectilinear full Steiner tree generation. Technical Report DIKU-TR-97/29, Department of Computer Science, University of Copenhagen, December 1997.
18. Dorigo M, Maniezzo V, Colorni A. The Ant System: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, and Cybernetics - Part B, 1996, 26(1): 1-13.
19. Das S, Gosavi S V, Hsu W H, Vaze S A. An ant colony approach for the Steiner tree problem. In Proc. Genetic and Evolutionary Computing Conference, New York City, New York, 2002.
20. Ganley J L. Computing optimal rectilinear Steiner trees: A survey and experimental evaluation. Discrete Applied Mathematics, 1998, 89: 161-171.
21. Hanan M. On Steiner's problem with rectilinear distance. SIAM Journal on Applied Mathematics, 1966, 14: 255-265.
22. Yang Y Y, Wing O. Suboptimal algorithm for a wire routing problem. IEEE Trans. Circuit Theory, September 1972, 19: 508-510.
23. Ganley J L, Cohoon J P. Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. In Proc. IEEE International Symposium on Circuits and Systems, London, UK, 1994, pp.113-116.