An Edge-Based Heuristic for Steiner Routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 13, Issue 12, 1994, Pages 1563-1568

  Borah, Manjit ^a   Owens, Robert Michael ^a   Irwin, Mary Jane ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; HEURISTIC METHODS; PERFORMANCE;

ASYMPTOTIC TIME COMPLEXITY; EDGE BASED HEURISTIC; MINIMUM RECTILINEAR SPANNING TREE; STEINER ROUTING;

INTEGRATED CIRCUIT LAYOUT;

EID: 0028733612     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.331412     Document Type: Article

References (22)

1. T. Barrera, J. Griffith, G. Robins, and T. Zhang, “Narrowing the GAP: Near-optimal steiner trees in polynomial time,” Univ. of Virginia, Computer Science Dept., Tech. Rep. CS-93-31, June 1993.
2. MCNC benchmark. Physical Design Workshop, 1989.
3. Piotr Berman and Viswanathan Ramaiyer, “Improved approximations for the steiner tree problem,” in Proc. Symp. Discrete Algorithms, Jan. 1992.
4. M. W. Bern and M. de Carvalho, “A greedy heuristic for rectilinear steiner tree problem,” Univ. California-Berkely, Tech. Rep., 1986.
5. T. H. Chao and Y. C. Hsu, “Rectilinear steiner tree construction by local and global refinement,” IEEE Trans. Computer-Aided Design, vol 13, no. 3, pp. 303-309, Mar. 1994.
6. C. Chiang, M. Sarrafzadeh, and C. K. Wong, “Global routing based on Steiner min-max trees,” IEEE Trans. Computer-Aided Design, vol. 9, no. 12, pp. 1318-1325, 1990.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, ch. 24, 1990.
8. M. Garey and D. S. Johnson, “The rectilinear steiner problem is NP-complete,” complete,” SIAM J. Appl. Math., vol. 32, no. 4, pp. 826-834, 1977.
9. Dov Harel and R. E. Tarjan, “Fast algorithms for finding nearest common ancestors,” SIAM J. Computing, vol. 13, no. 2, pp. 338-355, May 1984.
10. J. M. Ho, G. Vijayan, and C. K. Wong, “New algorithms for the rectilinear steiner tree problem,” IEEE Trans. Computer-Aided Design, vol. 9, no. 2, 185-193, 1990.
11. F. K. Hwang, “On steiner minimal trees with rectilinear distance,” SIAM J. Appl. Math., vol. 30, no. 1, pp. 104-114, 1976.
12. F. K. Hwang, “An O(n log n) algorithm for rectilinear minimal spanning trees,” J. Assn. for Computing Machinery, vol. 26, no. 2, pp. 177-182, Apr. 1979.
13. F. K. Hwang, “An 0(n log n) algorithm for suboptimal rectilinear steiner trees,, IEEE Trans. Circuits Syst., vol. 26, pp. 75-77, 1979.
14. A. B. Kahng and G. Robins, “A new class of iterative steiner tree heuristics with good performance,” IEEE Trans. Computer-Aided Design, vol. 11, no. 7, pp. 893-902, July 1992.
15. J. H. Lee, N. K. Bose, and F. K. Hwang, “Use of steiner's problem in suboptimal routing in rectilinear metric,” IEEE Trans. Circuits Syst., vol. 23, 470-476, 1976.
16. F. D. Lewis, W. C. Pong, and N. Van-Cleave, “Local improvements on Steiner trees,” in Proc. 3rd Great Lakes Symp. on VLSI, 1993, pp. 470-476.
17. A. Lim, S. W. Cheng, and C. T. Wu, “Performance oriented rectilinear steiner trees,” Proc. DAC, June 1993, pp. 171-176.
18. M. J. Irwin and R. M. Owens, “An overview of the Penn state design system,” in Proc. DAC, July 1987, pp. 516-522.
19. D. Richards, F. K. Hwang, and W. Winter, Steiner Tree Problems. New York: North Holland, ch. 2, 1992.
20. M. Sarrafzadeh and C. K. Wong, “Hierarchical Steiner tree construction in uniform orientations,” IEEE Trans. Computer-Aided Design, vol. 11, no. 9, pp. 1095-1103, Sept. 1992.
21. Robert E. Tarjan, “Applications of path compression on balanced trees,” J. Assn. for Computing Machinery, vol. 26, no. 4, pp. 690-705, Oct. 1979.
22. Jeffery D. Ullman, Computational Aspects of VLSI. Computer Science Press, Inc., ch. 9, 1984.