Efficient rectilinear steiner tree construction with rectilinear blockades

Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

Volumn 2005, Issue , 2005, Pages 38-44

  Shen, Zion ^a   Chu, Chris C N ^b   Li, Ying Meng ^c  

^a CADENCE DESIGN SYSTEMS   (United States)

^b IOWA STATE UNIVERSITY   (United States)

^c Atoptech Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RECTILINEAR BLOCKADES; RECTILINEAR STEINER MINIMAL TREE (BSMT);

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMAL SYSTEMS; PROBLEM SOLVING;

TREES (MATHEMATICS);

EID: 33748544610     PISSN: 10636404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCD.2005.45     Document Type: Conference Paper

References (17)

1. P. Berman, U. Fossmeier, M. Kaufmann, M. Karpinski and A. Zelikovsky. Approaching the 5/4-approximation for rectilinear Steiner trees. Proc. European Symp. on Algorithms (ESA), Springer Verlag Lecture Notes in Computer Science 762, pages 533-542, 1994.
2. M. Borah, R. M. Owens, and M. J. Irwin. A fast and simple Steiner routing heuristic., Springer Verlag Lecture Notes in Computer Science 762, pages 533-542, 1994.
3. M. Hanan. On Steiner's problem with rectilinear distance. SIAM Journal on Applied Mathematics, 14, pages 255-265, 1966.
4. F. K. Hwang and D. S. Richards and P. Winter. The Steiner tree problem. North-Holland, annals of Discrete Mathematics 53, 1992.
5. A. B. Kahng and G. Robins. A new class of iterative Steiner tree heuristics with good performance. IEEE Transaction on CAD, 11, pages 1462-1465, 1992.
6. A. Zelikovsky. An 11/6-approximation for the network Steiner tre problem. Algorithmica, 9, pages 463-470, 1993.
7. M. Garey and D. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math,32, pages 826-834, 1977.
8. C. Y. Lee. An algorithm for path connections and its application. IRE Transaction on Electronic Computers, VEC-10, pages 346-365, 1961.
9. S. B. Akers. A modification of Lee's Path Connection Algorithm. IEEE Transaction on Electronic Computer, 16(4), pages 97-98, 1967.
10. J. Soukup. Fast Maze Router. Proceeding, of 15th Design Automation Conference, pages 100-102, 1978.
11. F. Rubin. The Lee Connection Algorithm. IEEE Transaction on Computer, 23, pages 907-914, 1974.
12. Y. Yang, Q. Zhu, T. Jing, X. Hong and Y. Wang. Rectilinear Steiner minimal tree among obstacles. ASIC 5th Intl. Conf., Vol. 1, 21-24 pages 348-351, Oct. 2003.
13. T. Lengauer. combinatorial Algorithms for Integrated Circuit Layout. Wiley, England, 1990.
14. J. Ganley and J. P. Cohoon. Routing a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles. Intl. Symp. on Circuits and Systems, Vol. 1, pages 113-116, 1994.
15. 2 n) time. ACM Symp. on Computational Geometry, pages 251-257, 1987.
16. 3/2 n) time. Unpublished manuscript.
17. H. Zhou, N. Shenoy, and W. Nicholls. Efficient spanning tree construction without delaney triangulation. Information Processing Letter, 81(5), 2002.