Approximations for a bottleneck steiner tree problem

Algorithmica (New York)

Volumn 32, Issue 4, 2002, Pages 554-561

  Wang, L ^a   Du, D Z ^a,b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b University of Minnesota   (United States)

Author keywords

Steiner tree; Wireless communication

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

TREE PROBLEMS;

TREES (MATHEMATICS);

EID: 0141991980     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0089-4     Document Type: Article

References (22)

1. H. M. F. AboElFotoh, Algorithms for computing message delay for wireless networks, Networks 29 (1997), 117-124.
2. S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Proc. 37th FOCS, 1996.
3. D. Chen, D.-Z. Du, X. Hu, G. Lin, L. Wang, and G. Xue, Approximations for Steiner trees with minimum number of Steiner points, submitted for publication.
4. C. Chiang, M. Sarrafzadeh, and C. K. Wong, A powerful global router: based on Steiner min-max tree, Proc. ICCAD-89; also in IEEE Transactions on Computer-Aided Design, 19 (1990), 1318-1325.
5. C. Chiang, M. Sarrafzadeh, and C. K. Wong, A powerful global router: based on Steiner min-max tree, Proc. ICCAD-89; also in IEEE Transactions on Computer-Aided Design, 19 (1990), 1318-1325.
6. D.-Z. Du and F. K. Hwang, A proof of Gilbert-Pollak's conjecture on the Steiner ratio, Algoritlunica, 7 (1992), 121-135.
7. J. L. Ganley and J. S. Salowe, Optimal and approximate bottleneck Steiner trees, Operations Research Letters 19 (1996), 217-224.
8. M. R. Garey, R. L. Graham, and D. S. Johnson, The complexity of computing Steiner minimal trees, SIAM Journal on Applied Mathematics, 32 (1977), 835-859.
9. M. Gary and D. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM Journal on Applied Mathematics 32 (1977), 826-834.
10. M. Gary and D. Johnson, Computers and Intractability, Freeman, San Francisco, CA, 1979.
11. E. N. Gilbert, Minimum cost communication networks, Bell System Technical Journal, 9 (1967), 2209-2227.
12. E. N. Gilbert and H. O. Pollak, Steiner minimal trees, SIAM Journal on Applied Mathematics, 16 (1968), 1-29.
13. D. S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, Journal of the Association for Computing Machinery 32 (1985), 130-136.
14. F. K. Hwang and D. S. Richards, Steiner tree problems, Networks 22 (1992), 55-89.
15. F. K. Hwang, D. Richard, and P. Winter, The Steiner Minimum Tree Problems, Annals of Discrete Mathematics, Vol. 53, North-Holland, Amsterdam, 1992.
16. M. Karpinski and A. Zelikovsky, New approximation algorithms for the Steiner tree problems. Journal of Combinatorial Optimization 1(1) (1997), 47-65.
17. C.-S. Li, F. F. Tong, C. J. Georgiou, and M. Chen, Gain equalization in metropolitan and wide area optical networks using optical amplifiers, Proc. IEEE INFOCOM '94, pp. 130-137, June 1994.
18. G.-H. Lin and G. L. Xue, Steiner tree problem with minimum number of Steiner points and bounded edge-length, Information Processing Letters, 69 (1999), 53-57.
19. B. Ramamurthy, J. Iness, and B. Mukherjee, Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN/MAN, Proc. IEEE INFOCOM '97, pp. 261-268, April 1997.
20. J. L. Rubinstein and J. F. Weng, Compression theorems and Steiner ratios on spheres, Journal of Combinatorial Optimization 1(1) (1997), 67-78.
21. M. Sarrafzadeh and C. K. Wong, Bottleneck Steiner trees in the plane, IEEE Transactions on Computers, 41 (1992), 370-374.
22. J. Soukup, On minimum cost network with nonlinear costs, SIAM Journal on Computing, 29 (1975), 571-581.