Minimum Moment Steiner Trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 481-488

  Qiu, Wangqi ^a   Shi, Weiping ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; K-TH MOMENT STEINER MINIMUM TREE (K-SMT);

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; INTEGRATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

TREES (MATHEMATICS);

EID: 1842592045     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. J. Gong, K. S. Leung, and D. Zhou, Performance driven interconnect design based on distributed RC delay model, in Proc. 30th Design Automation Conf., June 1993, pp. 606-611.
2. M. R. Garey and D. S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math. 32 (1977), pp. 826-834.
3. M. Hanan, On Steiner's problem with rectilinear distance, SIAM J. Appl. Math. 14 (2) (1966), pp. 255-265.
4. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem, North-Holland, Amsterdam, 1992.
5. S. K. Rao, P. Sadayappan, F. K. Hwang, and P. W. Shor, The rectilinear Steiner arborescence problem, Algorithmica 7 (1992), pp. 277-288.
6. G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, in Proc. 11th ACM-SIAM Symp. Disc. Algo. (SODA), Jan. 2000, pp. 770-779.
7. J. Rubinstein, P. Penfield, Jr., and M. Horowitz, Signal delay in RC tree networks, IEEE Trans. on Computer-Aided Design 2 (3) (1983), pp. 202-211.
8. W. Shi and C. Su, The rectilinear Steiner arborescence problem is NP-complete, in Proc. 11th ACM-SIAM Symp. Disc. Algo. (SODA), Jan. 2000, pp. 780-787.