Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem

Journal of Combinatorial Optimization

Volumn 4, Issue 3, 2000, Pages 357-363

  Lu, Bing ^a   Ruan, Lu ^a  

^a University of Minnesota   (United States)

Author keywords

Approximation algorithm; Arborescence; PTAS; Steiner terminals; VLSI design

Indexed keywords

EID: 0038088241     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009826311973     Document Type: Article

References (8)

1. S. Arora, "Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems," Journal of the ACM, 45(5), Sept. 1998, pp. 753-782.
2. J. Cong, K.S. Leung, and D. Zhou, "Performance driven interconnect design based on distributed RC delay model," in Proc. ACM/IEEE Design Automation Conf., 1993, pp. 606-611.
3. J. Córdova and Y.H. Lee, "A heuristic algorithm for the rectilinear Steiner arborescence problem," University of Florida CIS Department Tech. Report TR-94-025, 1994.
4. R.R. Ladeira de Matos, "A rectilinear arborescence problem," Dissertation, University of Alabama, 1979.
5. K.S. Leung and J. Cong, "Fast optimal algorithms for the minimum rectilinear Steiner arborescence problem," in Proc. Intl Symposium on Circuits and Systems, May 1997, pp. 1568-1571.
6. L. Nastansky, S.M. Selkow, and N.F. Stewart, "Cost-minimal trees in directed acyclic graphs," Z. Oper. Res., vol. 18, pp. 59-67, 1974.
7. S.K. Rao, P. Sadayappan, F.K. Hwang, and P.W. Shor, "The rectiliear Steiner arborescence problem," Algorithmica, vol. 7, pp. 277-288, (1992).
8. W. Shi and C. Su, "The rectilinear Steiner arborescence problem is NP-complete," in 11th ACM-SIAM Symposium on Discrete Algorithms(SODA), January 2000, to appear.