New approximations for the rectilinear Steiner arborescence problem

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

Volumn 22, Issue 7, 2003, Pages 859-869

  Ramnath, Sarnath ^a  

^a ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Rectilinear Steiner arborescence; Routing signal nets; Very large scale integration (VLSI) physical design

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PERFORMANCE; THEOREM PROVING; VLSI CIRCUITS;

MINIMAL COVER APPROACH; RECTILINEAR STEINER ARBORESCENCE; ROUTING SIGNAL NETS;

INTEGRATED CIRCUIT LAYOUT;

EID: 0037767757     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2003.814249     Document Type: Article

References (19)

1. B. Chazelle, "A functional approach to data structures and its use in multidimensional searching," SIAM J. Comput., vol. 17, pp. 427-462, 1988.
2. J. Cordova and Y. Lee, "A Heuristic Algorithm for the Rectilinear Steiner Arborescence Problem," Dept. of Comput. Sci., Univ. Florida, Gainesville, FL, Tech. Rep. TR-94-025, 1994.
3. J. Gong, A. B. Kahng, and K. S. Leung, "Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design," IEEE Trans. Computer-Aided Design, vol. 17, pp. 24-39, Jan. 1998.
4. J. Gong, K. S. Leung, and D. Zhou, "Performance driven interconnect design based on the distributed RC delay model," in Proc. 30th Design Automation Conf., 1993, pp. 606-611.
5. P. J. de Rezende, D. T. Lee, and Y. F. Wu, "Rectilinear shortest paths in the presence of rectangular barriers," Discrete Computational Geometry, vol. 4, pp. 41-53, 1989.
6. J. M. Ho, M. T. Ko, T. H. Ma, and T. Y. Song, "Algorithms for rectilinear optimal multicast problem," in Proc. Int. Symp. Algorithms Computation, June 1992, pp. 106-115.
7. R. R. Laderia de Mates, "A rectilinear arborescence problem," Ph.D. dissertation, Univ. Alabama, 1979.
8. K. S. Leung and J. Gong, "Fast Optimal Algorithms for the Rectilinear Steiner Arborescence Problem," Comput. Sci. Dept., Univ. Calif., Los Angeles, Tech. Rep. CSD_960 037, 1996.
9. S. Li, private communication.
10. B. Lu and L. Ruan, "Polynomial time approximation scheme for the rectilinear steiner arborescence problem," J. Combinatorial Optimization, vol. 4, pp. 357-363, 2000.
11. E. M. McCreight, "Priority search trees," SIAM J. Comput., vol. 114, pp. 257-276, 1985.
12. 1 shortest paths among polygon obstacles in the plane," Algorithmica, vol. 1, pp. 55-88, 1992.
13. L. Nastansky, S. M. Selkow, and N. F. Stewart, "Cost minimum trees in directed acyclic graphs," Z. Oper. Res., vol. 18, pp. 59-67, 1974.
14. S. K. Rao, P. Sadyappan, F. K. Hwang, and P. W. Shor, "The rectilinear Steiner arborescence problem," Algorithmica, vol. 7, pp. 277-288, 1992.
15. N. Sarnak and R. E. Tarjan, "Planar point location using persistent search trees," Commun. ACM, vol. 29, no. 7, pp. 669-679, 1986.
16. V. A. Trubin, "Subclass of the Steiner problems on a plane with a rectilinear metric," Cybernetics, vol. 21, pp. 320-322, 1985.
17. W. Shi and C. Su, "The rectilinear Steiner arborescence problem is NP-complete," in ACM-SIAM Symp. Discrete Algorithms, Jan 2000, pp. 780-786.
18. On the Approximation of the Rectilinear Steiner Arborescence Problem in the Plane, M. Zachariasen. (2000). Available: http://citeseer.nj.nec.com/zachariasenOOapproximation.html [Online]
19. K. S. Leung and J. Gong, "Fast optimal algorithms for the rectilinear Steiner arborescence problem," in Proc. IEE Symp. Circuits and Systems, June 1997, pp. 1568-1571.