Loading...
Please wait, while we are loading the content...
Similar Documents
An efficient rectilinear steiner minimum tree algorithm based on ant colony optimization (2004).
| Content Provider | CiteSeerX |
|---|---|
| Author | Yan, Guiying Jing, Tong Feng, Zhe Hu, Xiaodong Hong, Xianlong Hu, Yu |
| Abstract | The rectilinear Steiner minimum tree (RSMT) problem is one of the fundamental problems in physical design, especially in routing, which is known to be NP-complete. This paper presents a practical heuristic for RSMT construction based on ant colony optimization (ACO). This algorithm has been implemented on a Sun workstation with Unix operating system and the results have been compared with the GeoSteiner 3.1 and a recent work using batched greedy triple construction (BGTC). Experimental results show that our algorithm, named ACO-Steiner, can get a very short run time and keep the high performance. |
| File Format | |
| Publisher Date | 2004-01-01 |
| Access Restriction | Open |
| Subject Keyword | Ant Colony Optimization Recent Work Rsmt Construction Rectilinear Steiner Minimum Tree Practical Heuristic Short Run Time High Performance Fundamental Problem Sun Workstation Experimental Result Physical Design Batched Greedy Triple Construction |
| Content Type | Text |
| Resource Type | Article |