Timing-driven Steiner trees are (practically) free

Proceedings - Design Automation Conference

Volumn , Issue , 2006, Pages 389-392

  Alpert, Charles J ^a   Kahng, Andrew B ^b   Sze, C N ^a   Wang, Qinke ^b  

^a IBM AUSTIN RESEARCH LABORATORY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Arborescence; Rectilinear Steiner tree; Timing driven

Indexed keywords

EMBEDDED SYSTEMS; INTEGRATED CIRCUIT LAYOUT; LOGIC DESIGN; ROUTING ALGORITHMS; TOPOLOGY;

ARBORESCENCE; RECTILINEAR STEINER TREE; ROUTABILITY; TIMING-DRIVEN;

DECISION TREES;

EID: 34547184654     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146909.1147012     Document Type: Conference Paper

References (21)

1. Personal communication with Dr. Weiping Shi.
2. C. J. Alpert, T. C. Hu, J. H. Huang, A. B. Kahng, and D. Karger. Prim-dijkstra tradeoffs for improved performance-driven routing tree design. IEEE TCAD, 14(7):890-896, July 1995.
3. K. D. Boese, A. B. Kahng, B. A. McCoy, and G. Robins. Near-optimal critical sink routing tree constructions. IEEE TCAD, 14(12):1417-36, Dec. 1995.
4. M. Borah, R. M. Owens, and M. J. Irwin. An edge-based heuristic for Steiner routing. IEEE TCAD, 13(12): 1563-1568, Dec. 1994.
5. M. Borah, R. M. Owens, and M. J. Irwin. A fast and simple Steiner routing heuristic. Discrete Applied Mathematics, 90:51-67, 1999.
6. C. Chu and Y.-C. Wong. Fast and accurate rectilinear steiner minimal tree algorithm for vlsi design. In ISPD, pp. 28-35, 2005.
7. J. Cong, A. B. Kahng, and K.-S. Leung. Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to vlsi physical design. IEEE TCAD, 17(1):24-39, Jan. 1999.
8. J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong. Provably good performance-driven global routing. IEEE TCAD, 11(6):739-752, June 1992.
9. J. Cordova and Y. H. Lee. A heuristic algorithm for the rectilinear Steiner arborescence problem. Tech. Report, CIS Department, Univ. of Florida, (TR-94-025), 1994.
10. J. Griffith, G. Robins, J. Salowe, and T. Zhang. Closing the gap: Near-optimal Steiner trees in polynomial time. IEEE TCAD, 13:1351-1365.
11. A. B. Kahng and G. Robins. On optimal interconnections for VLSI. Kluwer Academic Publishers, Boston, MA, 1995.
12. S. Khuller, B. Raghavachari, and N. Young. Balancing minimum spanning trees and shortest-path trees. ACM-SIAM SODA, pp. 243-250, 1993.
13. G. Kortsarz and D. Peleg. Approximating shallow-light trees. ACM-SIAM SODA, pp. 103-110, 1997.
14. P. Madden. BOI source code. http://vlsicad.ucsd.edu/GSRC/bookshelf/Slots/ RSMT/Madden_BOI.html.
15. M. Marathe, R. Ravi, R. Sundaram, S. Ravi, and D. Rosenkrantz. Bicriteria network design problems. In Intl. Colloquium Automata Languages and Programming (ICALP'95), pp. 487-498, 1995.
16. J. Naor and B. Schieber. Improved approximations for shallow-light spanning trees. FOCS, page 536, 1997. IEEE Computer Society.
17. S. Peyer, M. Zachariasen, and D. G. Jrgense,n. Delay-related secondary objectives for rectilinear Steiner minimum trees. Discrete Appl. Math., 136(2-3):271-298, 2004.
18. W. Qiu and W. Shi. Minimum moment Steiner trees. SODA, pp. 488-495, 2004.
19. S. K. Rao, P. Sadayappan, F. K. Hwang, and P. W. Shor. The rectilinear Steiner arborescence problem. Algorithmica, 7:277-288, 1992.
20. J. Soukup. Uniform steiner tree representation from the floor planning to the final routing. Unpublished manuscript.
21. D. M. Warme, P. Winter, and M. Zachariesen. Exact algorithms for plane Steiner tree problems: A computational study, pp. 81-116, 2000.