An-OARSMan: Obstacle-avoiding routing tree construction with good length performance

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 1, Issue , 2005, Pages 7-12

  Hu, Yu ^a   Jing, Tong ^a   Hong, Xianlong ^a   Feng, Zhe ^a   Hu, Xiaodong ^b   Yan, Guiying ^b  

^a TSINGHUA UNIVERSITY   (China)

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION (ACO); CONCAVE POLYGONS; IP BLOCK; MACRO CELLS; OBSTACLE-AVOIDING; OPTIMAL SOLUTIONS; PHYSICAL DESIGN; RECTILINEAR STEINER MINIMUM TREES; ROUTING PHASE; ROUTING TREES;

COMPUTER AIDED DESIGN; DECISION TREES; FORESTRY; HEURISTIC METHODS; MACROS;

ALGORITHMS;

EID: 84861445311     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. C.Y.Lee, "An alogrithm for path connections and its applications". IRE Trans on Electronic Computers, 1961, 10: pp. 346-365.
2. S.Q.Zheng, J.S.Lim, and S.S.Iyengar, "Finding obstacle-avoiding shortest paths using implicit connection graphs". IEEE Trans on CAD, 1996,15(1): pp. 103-110.
3. Y.F.Wu, P.Widmayer, M.D.F.Schlag, and C.K.Wong. "Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles", IEEE Trans on Computers, 1987, 36(3): pp. 321-331.
4. J.L.Ganley and J.P.Cohoon, "Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles". In Proc. of IEEE ISCAS, London, UK, 1994: pp. 113-116.
5. M.Zachariasen and P.Winter, "Obstacle-avoiding Euclidean Steiner trees in the plane: an exact algorithm", extended abstract presented at the Workshop on Algorithm Engineering and Experimentation (ALENEX), 1999.
6. Y.Yang, Q.Zhu, T.Jing, X.L.Hong, and Y.Wang, "Rectilinear Steiner Minimal Tree among Obstacles". In Proc. of IEEE ASICON, Beijing, China, 2003: pp. 348-351
7. M.Dorigo, V.Maniezzo, and A.Colomi, "The Ant System: Optimization by a colony of cooperating agents", IEEE Trans on Systems, Man, and Cybernetics-Part B, 1996, 26(1): pp.1-13.
8. S.Das, S.V.Gosavi, W.H.Hsu, and S.A.Vaze, "An Ant Colony Approach for the Steiner Tree Problem", In Proc. of Genetic and Evolutionary Computing Conference, New York City, New York, 2002.
9. S.B.Akers, "A Modification of Lee's Path Connection Algorithm", IEEE Trans on Electronic Computer, 1967, 16(4): pp. 97-98.
10. J.Soukup, "Fast Maze Router", In Proc. of 15th DAC, 1978: pp. 100-102.
11. Hadlock, "A Shortest Path Algorithm for Grid Graphs", Networks, 1977(7): pp. 323-334.
12. F.Rubin, "The Lee Connection Algorithm", IEEE Trans on Computer, 1974(23): pp. 907-914.
13. M.R.Garey and D.SJohnson, "The rectilinear Steiner tree problem is NP-complete" SIAM Journal on Applied Mathematics, 1977(32): pp. 826-834.
14. D.W.Hightower, "A Solution to the Line Routing Problem on the Continous Plane", In Proc. of the 6th DAC, 1969: pp. 1-24.
15. K.Mikami and K.Tabuchi, "A Computer Program for Optimal Routing of Printed Circuit Connectors", in Proc of IFIPS, 1968, H47: pp. 1475-1478.
16. Yu Hu, Zhe Feng, Tong Jing, Xianlong Hong, Yang Yang, Ge Yu, Xiaodong Hu, and Guiying Yan, "A 3-Step Heuristic for Obstacle-Avoiding Rectilinear Steiner Minimum Tree Construction", in Proc. of ISC&I04, Zhuhai, China, pp. 1017-1021.