Steiner tree problems in computer communication networks

Steiner Tree Problems in Computer Communication Networks

Volumn , Issue , 2008, Pages 1-359

  Du, Dingzhu ^a   Hu, Xiaodong ^b  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER NETWORKS; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTER COMMUNICATION NETWORKS; STEINER TREE PROBLEM; THEORY AND PRACTICE;

TREES (MATHEMATICS);

EID: 84967468263     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/6729     Document Type: Book

References (281)

1. A. Agrawal, P. Klein, and R. Ravi, When trees collide: An approximaa-tion algorithm for the generalized Steiner tree problem on networks, SIAM Journal on Computing,24(3)(1995), 440-456.
2. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, Wireless sensor networks: a survey, Computer Networks,38(4)(2002), 393-422.
3. 2, Pacific Journal of Mathematics,149(2)(1991), 201-210.
4. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor, A general approach to online network optimization problems, ACM Transactions on Algorithms,2(4)(2006), 640-660.
5. M. Ali and J. S. Deogun, Power-efficient design of multicast wavelength-routed networks, IEEE Journal on Selected Areas in Communications, 18(10)(2000), 1852-1862.
6. K. D. Andersen, An efficient Netwon barrier method for minimizing a sum of Euclidean norms, SIAM Journal on Optimization,6(1)(1996), 74-95.
7. K. D. Andersen, E. Christiansen, A. R. Conn, and M. L. Overton, An efficient primal-dual interior-point method for minimizing a sum of Euclidean norms, SIAM Journal on Scientific Computing,22(1)(2000), 243-262.
8. S. Angelopoulos, Improved bounds for the online Steiner tree problem in graphs of bounded edge-asymmetry, Technical Report CS-2006-36, David R. Cheriton School of Computer Science, University of Waterloo, 2006.
9. V. Annamalai, S. K. S. Gupta, and L. Schwiebert, On tree-based converge-casting in wireless sensor networks, IEEE Wireless Communication and Networking Conference (WCNC), 2003, vol. 4, pp. 1942-1947.
10. S. Arora, Polynomial-time approximation schemes for Euclidean TSP and other geometric problems, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS), 1996, 2-12. (Also appear in Journal of the ACM, 45(5)(1998), 753-782.)
11. S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), 1997, pp. 554-563.
12. S. Arora, Approximation schemes for NP-hard geometric optimization problems: a survey, Mathematical Programming,97(1-2)(2003), 43-69.
13. S. Arora, M. Grigni, D. Karger, P. Klein, and A. Woloszyn, Polynomial time approximation scheme for weighted planar graph TSP, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms(SODA), 1998, pp. 33-41.
14. S. Arora and G. Karakostas, A 2 + e approximation algorithm for the fc-MST problem, Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms (SODA), 2000, pp. 754-759.
15. S. Arora and C. Lund, Hardness of approximation, in Algorithms for NP-Hard Problems, D. Hochbaum (ed.), PWS Publishing Company, 1996, pp. 399-466.
16. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, Journal of the ACM, 45(3)(1998), 501-555. (Preliminary version appeared in Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (FOCS), 1992, pp. 14-23.)
17. S. Arora, P. Raghavan, and S. Rao, Polynomial time approximation scheme for Euclidean fc-medians and related problems, Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), 1998, pp. 106-113.
18. S. Arora and M. Safra, Probabilistic checking of proofs: a new characterization of NP, Journal of the ACM,45(1)(1998), 70-122. (Preliminary version appeared in Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (FOCS), 1992, pp. 2-12.)
19. V. Arora, S. Vempala, H. Saran, and V. V. Vazirani, A Limited-backtrack greedy schema for approximation algorithms, Lecture Notes in Computer Science,1994, Vol. 880, pp. 318-329.
20. V. Aulettaa, Y. Dinitzb, Z. Nutovc, and D. Parented, A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph, Journal of Algorithms,32(1)(1999), 21-30.
21. Y. Aumann and Y. Rabani, Improved bounds for all-optical routing, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1995, pp. 567-576.
22. D. Banerjee and B. Mukherjee, A practical approach for routing and wavelength assignment in large wavelength-routed optical networks, IEEE Journal on Selected, Areas in Communications,14(5)(1996), 903-908.
23. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, Message multicasting in heterogeneous networks, SIAM Journal on Computing,30(2)(2000), 347-358.
24. S. Baroni and P. Bayvel, Wavelength requirements in arbitrarily connected wavelength-routed optical networks, IEEE Journal of Lightwave Technology,15(2)(1997), 242-251.
25. G. Di Battista, G. Liotta, and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, Lecture Notes in Computer Science,1993, vol. 709, pp. 151-162.
26. J. E. Beasley, A heuristic for the Euclidean and rectilinear Steiner problems, European Journal of Operational Research,58(2)(1992), 284-292.
27. M. Bellare, O. Goldreich, and M. Sudan, Free bits and non-approximability-towards tight results, SIAM Journal on Computing,27(3)(1998), 804-915.
28. P. Berman and C. Coulston, On-line algorithms for Steiner tree problems, Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (STOC), 1997, 344-353.
29. P. Berman and V. Ramaiyer, Improved approximation algorithms for the Steiner tree problem, Journal of Algorithms,17(3)(1994), 381-408.(Preliminary version appeared in Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 1992, pp. 325-334.)
30. P. Berman and A. Zelikovsky, On the approximation of power-p and bottleneck Steiner trees, in Advances in Steiner Trees, D.-Z. Du, J. H. Rubinstein, and J. M. Smith (eds.), Kluwer Academic Publishers, 2000, pp. 117-135.
31. M. Bern, Two probabilistic results on rectilinear Steiner trees, Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), 1986, pp. 433-441.
32. M. Bern and D. Eppstein, Approximation algorithms for geometric problems, Approximation Algorithms for NP-Hard Problems, D. Hochbaum (ed.), PWS Publishing Company, Boston, 1997, 296-345.
33. M. W. Bern and R. L. Graham, The shortest-network problem, Scientific American, January, 1988, 84-89.
34. M. Bern and P. Plassmann, The Steiner problem with edge length 1 and 2, Information Processing Letters,32(3)(1989), 109-120.
35. K. Bharath-Kumar and J. M. Jaffe, Routing to multiple destinations in computer network, IEEE Transactions on Communications,31(3)(1983), 343-351.
36. T. Biedl and G. Kant, A better heuristic for orthogoanl graph drawings, Computational Geomety,9(3)(1998), 159-180.
37. D. Bienstock, E. F. Brickell, and C. L. Monma, On the Structure of Minimum-Weight fc-Connected Spanning Networks, SIAM Journal on Discrete Mathematics,3(3)(1990), 320-329.
38. R. S. Booth, Analytic formulas for full Steiner trees, Discrete Computational Geometry,6(1)(1991), 69-82.
39. A. Borchers and D.-Z. Du, The fc-Steiner ratio in graphs, SIAM Journal on Computing,26(3)(1997), 857-869.
40. A. Borchers, D.-Z. Du, B. Gao, and P.-J. Wan, fc-Steiner ratio in the rectilinear plane, Journal of Algorithms,29(1998), 1-17.
41. O. Bottems, Geometric Inequalities,1968.
42. Z.-P. Cai, G.-H. Lin, and G.-L. Xue, Improved approximation algorithms for the capacitated multicast routing problem, Lecture Notes in Computer Science, 2005, vol. 3595, pp. 136-145.
43. G. Calinescu and A. Zelikovsky, The polymatroid Steiner problems, Journal of Combinatorial Optimization,9(3)(2005), 281-294.
44. S. -K. Chang, The generation of minimal trees with a Steiner topology, Journal of the ACM,19(1972), 699-711.
45. S.-K. Chang, The design of network configurations with linear or piecewise linear cost functions. Symposium on Computer-Communications, Networks, and Teletraffic,1972, pp. 363-369.
46. O. Chapovska and A. P. Punnen, Variations of the prize-collecting Steiner tree problem, Networks,47(4)(2006), 199-205.
47. M. Charikar, J. Kleinberg, R. Kumar, S. Rajagopalan, A. Sahai, and A. Tomkins, Minimizing wirelength in zero and bounded skew clock trees, SIAM Journal on Discrete Mathematics,17(4)(2004), 582-595.
48. C. Chiang, M. Sarrafzadeh, and C. K. Wong, A powerful global router: based on Steiner min-max tree, IEEE Transactions on Computer-Aided Design,19(1990), 1318-1325.
49. M. Charikar, J. Naor, and B. Schieber, Resource optimization in QoS multicast routing of real-time multimedia, IEEE/ACM Transactions on Networking, 12(2)(2004), 340-348.
50. D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang, and G. Xue, Approximations for Steiner trees with minimum number of Steiner points, Journal of Global Optimization,18(1)(2000), 17-33.
51. X.-J. Chen, X.-D. Hu, X.-H. Jia, Inapproximability and approximability of minimal tree routing and coloring, Journal of Discrete Algorithms, to appear in 2007.
52. X.-J. Chen, X.-D. Hu, and T.-P. Shuai, Inapproximability and approximability of maximal tree routing and coloring, Jouranl of Combinatorial Optimization,11(2)(2006), 219-229.
53. X.-J. Chen, X.-D. Hu, and J.-M. Zhu, Minimum data aggregation time problem in wireless sensor networks, Lecture Notes in Computer Sciences, 2005, vol. 3794, pp. 133-142.
54. X.-Z. Cheng, B. DasGupta, and B. Lu, A polynomial time approximation scheme for the symmetric rectilinear Steiner arborescence problem, Journal of Global Optimization,21(4)(2001), 385-396.
55. X.-Z. Cheng and D.-Z. Du, Steiner trees in Industry, Kluwer Academic Publishers, Dordrecht, 2001.
56. X.-Z. Cheng, D.-Z. Du, J.-M. Kim, and H. Q. Ngo, Guillotine cut in approximation algorithms, in Cooperative Control and Optimization, R. Murphey and P. M. Pardalos (eds.), Springer US, 2002, pp. 21-34.
57. X. Cheng, X. Hang, D. Li, W. Wu, and D.-Z. Du, A polynomial time approximation scheme for minimum connected dominating set in ad hoc wireless networks, Networks,42(4)(2003), 202-208.
58. J. Cheriyan and R. Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching, SIAM Journal on Computing, 30(2)(2000), 528-560.
59. S. Cheung and A. Kumar, Efficient quorumcast routing algorithms, Proceedings of the 13th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 1994, pp. 840-855.
60. E. A. Choukhmane, Une heuristique pour le probleme de l’arbre de Steiner, RAIRO Recherche Operationnelle,12(1978), 207-212.
61. N. Christonfides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report, GSIA, Carnegie-Mellon University, 1976.
62. F. R. K. Chung and E. N. Gilbert, Steiner trees for the regular simplex, Bulletin of Institute of Mathematics Academia Sinica,4(1976), 313-325.
63. F. R. K. Chung and R. L. Graham, A new bound for Euclidean Steiner minimum trees, Annals of the New York Academy of Sciences,440(1985), 328-346.
64. F. R. K. Chung and F. K. Hwang, A lower bound for the Steiner tree problem, SIAM Journal of Applied Mathematics,34(1)(1978), 27-36.
65. V. Chvatal, A greedy heuristic for the set-covering problem, Mathematics of Operations Research,4(3)(1979), 233-235.
66. D. Cieslik, The Steiner ratio of Banach-Minkowski planes, In Contemporary Methods in Graph Theory, R. Bodendiek (ed.), BI-Wissenschatteverlag, Mannheim, 1991, pp. 231-248.
67. D. Cieslik, The Steiner Ratio of Banach-Minkowski spaces - A Survey, In Handbook of Combinatorial Optimization, D.-Z. Du and P. M. Pardalos (eds.), 2005, pp. 55-81.
68. D. Cieslik, Steiner Minimal Trees, Kluwer Academic Publishers, The Netherlands, 1998.
69. D. Cieslik, The Steiner Ratio, Kluwer Academic Publishers, The Netherlands, 2001.
70. R. Crourant and H. Robbins, What is Mathematics?, Oxford University Press, New York, 1941.
71. J. R. Current, C. S. Revelle, and J. L. Cohon, The hierarchical network design problem, European Journal of Operations Research,27(1)(1986), 5766.
72. V. F. Dem’yanov and V. N. Malozemov, Introduction to Minimax, Dover Publications, Inc., New York, 1974.
73. D. E. Drake and S. Hougardy, On approximation algorithms for the terminal Steiner tree problem, Information Processing Letters,89(1)(2004), 15-18.
74. D. R. Dreyer and M. L. Overton, Two heuristics for the Steiner tree problem, Journall of Global Optimization,13(1)(1998), 95-106.
75. D.-Z. Du, Minimax and its applications, Handbook of Global Optimization, R. Horst and P. M. Pardalos (eds.), Kluwer Academic Publishers, 1995, pp. 339-367.
76. D.-Z. Du, On component size bounded Steiner trees, Discrete Applied Mathematics, 60(1-3)(1995), 131-140.
77. D.-Z. Du, B. Gao, R. L. Graham, Z.-C. Liu, and P.-J. Wan, Minimum Steiner trees in normed planes, Discrete and Computational Geometry, 9(1)(1993), 351-370.
78. D.-Z. Du, D. F. Hsu, and K.-J. Xu, Bounds on guillotine ratio, Congressus Nemerantium,58(1987), 313-318.
79. X.-F. Du, X.-D. Hu, and X.-H. Jia, On shortest fc-edge-connected Steiner networks in metric spaces, Journal of Combinatorial Optimization, 4(1)(2000), 99-107.
80. D.-Z. Du and F. K. Hwang, A new bound for the Steiner ratio, Transactions of American Mathematical Society,278(1)(1983), 137-148.
81. D.-Z. Du and F. K. Hwang, A proof of Gilbert-Pollak’s conjecture on the Steiner ratio, Algorithmica,7(1)(1992), 121-135.(Preliminary version appeared in the proceedings of Proceedings of the 31st IEEE Foundations of Computer Science (FOCS), 1990, pp. 76-85.)
82. D.-Z. Du and F. K. Hwang, Reducing the Steiner problem in a normed space with a d-dimensional polytope as its unit sphere, SIAM Journal on Computing,21(6)(1992), 1001-1007.
83. D.-Z. Du and F. K. Hwang, The State of art on Steiner ratio problems, Lectures Notes Series on Computing (2nd Edition), D.-Z Du and F. K. Hwang (eds.), World Scientific Publishing Cl. Pte. Ltd., 1995, vol. 4, pp. 195-222.
84. D.-Z. Du, F. K. Hwang, M. T. Shing, and T. Witbold, Optimal routing trees, IEEE Transactions on Circuits,35(10)(1988), 1335-1337.
85. D.-Z. Du, F. K. Hwang, and E.-N. Yao, The Steiner ratio conjecture is true for five points, Journal of Combinatorial Theorey (Ser. A), 32(3)(1982), 396-400.
86. D.-Z. Du, L.-Q. Pan, and M.-T. Shing, Minimum edge length guillotine rectangular partition, Technical Report 0241886, Mathematical Sciences Research Institute, University of California, Berkeley, 1986.
87. D.-Z. Du, J. M. Smith and J. H. Rubinstein, Advances in Steiner Trees, Kluwer Academic Publishers, Dordrecht, 2000.
88. D.-Z. Du, L.-S. Wang, and B.-G. Xu, The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points, Lecture Notes in Computer Science,2001, vol. 2108, pp. 509-518.
89. D.-Z. Du and Y.-J. Zhang, On heuristics for minimum length rectilinear partitions, Algorithmica,5(1)(1990), 111-128.
90. D.-Z. Du and Y.-J. Zhang, On better heuristic for Steiner minimum trees, Mathematical Programming,57(2)(1992), 193-202.
91. D.-Z. Du, Y.-J. Zhang, and Q. Feng, On better heuristic for Euclidean Steiner minimum trees, Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1991, pp. 431-439.
92. C. Duin and A. Volgenant, The multi-weighted Steiner tree problem, Annals of Operations Research,33(1-4)(1991), 451-469.
93. J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, Journal of Research of the National Bureau of Standards, B 69(1965), 125-130.
94. J. Edmonds, Edge-disjoint branchings, In Combinatorial Algorithms, R. Rustin (ed.), Academic Press: New York, USA, 1973, pp. 91-96.
95. J. Edmonds, Matroid intersection. Annals of Discrete Mathematics, 4(1979), 185-204.
96. T. Erlebach and K. Jansen, The complexity of path coloring and call scheduling, Theorectical Computer Science,255(1-2)(2001) 33-50.
97. C. El-Arbi, Une heuristique pour le probleme de l’Arbre de Steiner, RAIRO Recherche Operationnelle,12(1978), 207-212.
98. U. Feige, A threshold of ln(n) for approximating set cover, Journal of the ACM,45(4)(1998), 634-652.
99. U. Feige and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer System Sciences,57(2)(1998) 187-199.
100. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker, Sharing the cost of multicast transmissions, Journal of Computer and System Sciences, 63(1)(2001), 21-41.
101. G. N. Fredrickson and J. Ja’Ja, On the relationship between the biconnectivity augmentation and traveling salesman problem, Theoretical Computer Science,19(2)(1982), 189-201.
102. J. Friedel and P. Widmayer, A simple proof of the Steiner ratio conjecture for five points, SIAM Journal of Applied Mathematics,49(3)(1989), 960-967.
103. H. N. Gabow, Better performance bounds for finding the smallest fc-edge connected spanning subgraph of a multigraph, Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms,2003, pp. 460-469.
104. H. N. Gabow, M. X. Goemans, E. Tardos, and D. P. Williamson, Approximate the smallest fc-edge connected spanning subgraph by LP-rounding, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms,2005, pp. 562-571.
105. R. Gandhi, S. Parthasarathy, and A. Mishra, Minimizing broadcasting latency and redundancy in ad hoc networks, Proceedings of the 4th ACM international Symposium on Mobile ad hoc Networking and Computing(Mo-biHoc), 2003, pp. 222-231.
106. J. L. Ganley and J. S. Salowe, Optimal and approximate bottleneck Steiner trees, Operations Research Letters,19(5)(1996), 217-224.
107. J. L. Ganley and J. S. Salowe, The power-p Steiner tree problem, Nordic Journal of Computing,5(2)(1998), 115-127.
108. B. Gao, D.-Z. Du, and R. L. Graham, A tight lower bound for the Steiner ratio in Minkowski planes. Discrete Mathematics,142(1)(1995), 49-63.
109. M. R. Garey, R. L. Graham, and D. S. Johnson, The complexity of computing Steiner minimal trees, SIAM Journal on Applied Mathematics, 32(4)(1977), 835-859.
110. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman and Company, San Francisco, 1979.
111. M. R. Garey and D. S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM Journal on Applied Mathematics,32(4)(1977), 826-834.
112. N. Garg, Saving an epsilon: a 2-approximation for the k-MST problem in graphs, Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005, pp. 396-402.
113. N. Garg, G. Konjevod, and R. Ravi, A polylogarithmic approximation algorithm for the group Steiner tree problem, Journal of Algorithms, 37(1)(2000), 66-84.
114. E. N. Gilbert and H. O. Pollak, Steiner minimal trees, SIAM Journal on Applied Mathematics,16(1)(1968), 1-29.
115. M. X. Goemans and D. P. Williamson, The primal-dual method for approximation algorithms and its application to network design problems. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, 1997, pp. 144-191.
116. M. C. Golumbic and R. E. Jamison, The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory (Series B), 38(1)(1985), 8-22.
117. T. Gonzalez and S. Q. Zheng, Bounds for partitioning rectilinear polygons, Proceedings of the 1st Annual Symposium on Computational Geometry, 1985, pp. 281-287.
118. R. L. Graham, An efficient algorithm for determining the convex hull of a finite set of points, Information Processing Letters,1(4)(1972), 132-133.
119. R. L. Graham and F. K. Hwang, Remarks on Steiner minimal trees, Bulletin of Institute of Mathematics Academia Sinica,4(1976), 177-182.
120. C. Groepl and S. Hougardy, Approximation algorithms for the Stiner tree problem in graphs, in Steiner Trees in Industries, D.-Z. Du and X. Cheng (eds.), Kluwer Academic Publishers, 2001, pp. 235-280.
121. C. Groepl, S. Hougardy, T. Nierhoff, and H. J. Proemel, Steiner trees in uniformly quasi-bipartite graphs, Information Processing Letters,83(4)(2002), 195-200.
122. J. Gu, X.-D. Hu, X. Jia, and M.-H. Zhang, Routing algorithm for multicast under multi-tree model in optical networks, Theoretical Computer Science, 314(1-2)(2004), 293-301.
123. J. Gu, X.-D. Hu, and M.-H. Zhang, Algorithms for multicast connection under multi-path routing model, Information Processing Letters, 84 (1)(2002), 31-39.
124. U. I. Gupta, D. T. Lee, and Y.-T. Leung, Efficient algorithms for interval graphs and circular-arc graphs, Networks,12(4)(1982) 459-467.
125. R. L. Hadas, Efficient collective communication in WDM networks with a power budget, in proceedings of IEEE International Conference on Computer Communication Network (ICCCN), 2000, pp. 612-616.
126. S. L. Hakimi, Steiner’s problem in graphs and its implications, Networks, 1(2)(1971), 113-133.
127. P. Hall, On representatives of subsets, Journal of the London Mathematical Society,10(1935), 26-30.
128. M. M. Halldorsson, A still better performance guarantee for approximate graph coloring, Information Processing Letters,45(1)(1993), 19-23.
129. M. M. Halldorsson, Approximations of weighted independent set and hereditary subset problems, Journal of Graph Algorithms and Applications, 4(1)(2000), 1-16.
130. M. Hanan, On Steiner’s problem with rectilinear distance, SIAM Journal on Applied Mathematics,14(2)(1966), 255-265.
131. H. A. Harutyunyan and A. L. Liestman, Improved upper and lower bounds for fc-broadcasting, Networks,37(2)(2001), 94-101.
132. 1-e, Acta Mathematica, 182(1)(1999), 105-142.
133. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, An application-specific protocol architecture for wireless microsensor networks, IEEE Transactions on Wireless Communications,1(4)(2002), 660-670.
134. C. H. Helvig, G. Robins, and A. Zelikovsky, Improved approximation scheme for the group Steiner problem, Networks,37(1)(2001), 8-20.
135. D. S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, Journal of ACM, 32(1)(1985), 130-136.
136. S. Hougardy and H. J. Prommel, A 1.598-approximation algorithm for the Steiner problem in graphs, Proceedings of ACM/SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 448-453.
137. D. F. Hsu and X.-D. Hu, On shortest two-edge-connected Steiner networks with Euclidean distance, Networks,32(2)(1998), 133-140.
138. D. F. Hsu, X.-D. Hu, and Y. Kajitani, On shortest fc-edge-connected Steiner networks with rectilinear distance, Nonconvex Optimization and its Application, Kluwer Academic Publisher, Dordrecht, 1995, vol. 4, pp. 119-127.
139. D. F. Hsu, X.-D. Hu, and G.-H. Lin, On minimum-weight fc-edge connected Steiner networks on metric spaces, Graphs and Combinatorics,16(3)(2000), 275-284.
140. X.-D. Hu and F. K. Hwang, Reliability of chordal rings, Networks, 22(5)(1992), 487-501.
141. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns, NC-approximation schemes for NP-and PSPACE-hard problems for geometric graphs, Journal of Algorithms, 26(2)(1998), 238-274.
142. F. K. Hwang, On Steiner minimal trees with rectilinear distance, SIAM Journal on Applied Mathematics,30(1)(1976), 104-114.
143. F. K. Hwang and D. S. Richards, Steiner tree problems, Networks, 22(1)(1992), 55-89.
144. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner minimum tree problems, North-Holland, Amsterdam, 1992.
145. F. K. Hwang and J. F. Weng, Hexagonal coordinate systems and Steiner minimal trees, Discrete Mathematics, 62(1)(1986), 49-57.
146. F. K. Hwang and Y. C. Yao, Comments on Bern’s probabilistic results on rectilinear Steiner trees, Algorithmica,5(1)(1990), 591-598.
147. E. Ihler, The complexity of approximating the class Steiner tree problem, Lecture Notes in Computer Science,1992, vol. 570, pp. 85-96.
148. T. Imielinski and S. Goel, DataSpace: querying and monitoring deeply networked collections in physical space, IEEE Personal Communication, 7(5)(2000), 4-9.
149. A. O. Ivanov and A. A. Tuzhilin, Minimal Networks: The Steiner Problem and Its Generalizations, Boca Raton, FL: CRC Press, 1994.
150. A. Itai, C. H. Papadimitriou, and J. Szwarcfiter, Hamiltonian paths in grid graphs, SIAM Journal on Computing,11(4)(1982), 676-686.
151. B. Jackson, Shortest circuit covers and postman tours in graphs with a nowhere zero 4-flow, SIAM Journal on Computing,19(4)(1990), 659-665.
152. K. Jain, Factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica,1 (2001), 39-60. (Preliminary version appeared in Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), 1998, pp. 448-457.)
153. X.-H. Jia, D.-Z. Du, and X.-D. Hu, Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks, Computer Communications,24(14)(2001), 1390-1399.
154. X.-H. Jia, D.-Z. Du, X.-D. Hu, M. K. Lee, and J. Gu, Optimization of wavelength assignment for QoS multicast WDM networks, IEEE Transaction on Communications,49(2)(2001), 341-350.
155. X.-H. Jia, X.-D. Hu, and D.-Z. Du, Multiwavelength Optical Networks, Kluwer Academic Publishers, The Netherlands, 2002.
156. D. S. Johnson, M. Minkoff, and S. Phillips, The prize collecting Steiner tree problem: theory and practice. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 760-769.
157. T. Jordan, On minimally fc-edge-connected graphs and shortest fc-edge-connected Steiner networks, Discrete Applied Mathematics,131(2)(2003), 421-432.
158. R. Jothiy and B. Raghavachariy, Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design, Lecture Notes in Computer Science,2004, vol. 3142, pp. 805-818.
159. R. Jothi, B. Raghavachari, and S. Varadarajan, A 5/4-approximation algorithm for minimum 2-edge-connectivity, Proceedings of the 14th annual ACM-SIAM symposium on Discrete Algorithms,2003, pp. 725-734.
160. A. Kahng and G. Robins, A new family of Steiner tree heuristics with good performance: the iterated 1-Steiner approach, Proceedings of IEEE International Conference on Computer-Aided Design,1990, pp. 428-431.
161. K. Kalpakis, K. Dasgupta, and P. Namjoshi, Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks, Computer Networks,42(6)(2003), 697-716.
162. J. N. Al-Karaki and A. E. Kamal, Routing techniques in wireless sensor networks: a survey, IEEE Wireless Communications,11(6)(2004), 6-28.
163. R. M. Karp, Reducibility among combinatorial problems. In Complexity of Computer Computation, R. E. Miller and J. W. Tatcher (eds.), Plenum Press, New York, 1972, pp. 85-103.
164. M. Karpinski, I. I. Mandoiu, A. Olshevsky, and A. Zelikovsky. Improved approximation algorithms for the quality of service Steiner tree problem. Algorithmica, 42(2)(2005), 109-120.
165. M. Karpinski and A. Zelikovsky, New approximation algorithms for the Steiner tree problems, Journal of Combinatorial Optimization,1(1)(1997), 47-65.
166. A. Kesselman and D. Kowalski, Fast distributed algorithm for convergecast in ad hoc geometric radio networks, Journal of Parallel and Distributed Computing,66(4)(2006), 578-585.
167. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, Journal of Algorithms, 21(2)(1996), 434-450.
168. S. Khuller, B. Raghavachari, and N. Young, Balancing minum spanning trees and shortest path trees, Algorithmica,14(4)(1995), 305-321.
169. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of the ACM,42(2)(1994), 214-235.
170. J. Kim, M. Cardei, I. Cardei, and X.-H. Jia, A polynomial time approximation scheme for the grade of service Steiner minimum tree problem, Journal of Global Optimization,24(4)(2002), 437-448.
171. P. Klein and R. Ravi, A nearly best-possible approximation algorithm for node-weighted Steiner trees, Journal of Algorithms,19(1)(1995), 104-115.
172. J. M. Kleinberg, Approximation algorithms for disjoint paths problems, Ph.D. Thesis, MIT, Cambridge, MA, 1996.
173. J. Kleinberg and E. Tardos, Disjoint paths in densely embedded graphs, Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1995, pp. 52-61.
174. S. G. Kollipoulos and C. Stein, Approximating disjoint-path problems using greedy algorithms and packing integer programs, Integer Programming and Combinatorial Optimization, Houston, TX, 1998.
175. P. Korthonen, An algorithm for transforming a spanning tree into a Steiner tree, Survey of Mathematical Proglramming, North-Holland, 1974, vol. 2, pp. 349-357.
176. G. Kortsarz and Z. Nutov, Approximating node connectivity problems via set covers, Algorithmica, 37(2003), 75-92.
177. G. Kortsarz and Z. Nutov, Approximating fc-node connected subgraphs wia critical graphs, SIAM Journal on Computing,35(1)(2005), 247-257.
178. L. Kou and K. Makki, An even faster approximation algorithm for the Steiner tree problem in graph, Congressus Numerantium,59(1987), 147-154.
179. L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Informatica,15(2)(1981), 141-45.
180. M. E. Kramer and J. van Leeuwen, The complexity of wire routing and finding the minimum area layouts for arbitrary VLSI circuits, in Advances in Computing Research; VLSI Theory, F. P. Preparata (ed.), JAI Press Inc. Greenwich, CT-London, 1984, vol. 2, pp. 129-146.
181. S. O. Krumke, M. V. Marathe, and S. S. Ravi, Models and approximation for channel assignment in radio networks, Wireless Networks,7(6)(2001), 575-584.
182. J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of American Mathematical Society, 7(1)(1956), 48-50.
183. H. W. Kuhn, Steiner’s problem revisted, In Studies in Optimization, G. B. Dantzig and B. C. Eaves (eds.), The Mathematical Association of America, 1975, pp. 53-70.
184. S. Lee and J. A. Ventura, An algorithm for constructing minimal c-broadcast networks, Networks,38(1)(2001), 6-21.
185. D.-Y. Li, X.-H. Jia, and H. Liu, Energy efficient broadcast routing in static ad hoc wireless networks, IEEE Transactions on Mobile Computing, 3(2)(2004), 144-151.
186. D. Lichtenstein, Planar formulae and their uses, SIAM Journal on Computing,11(2)(1982), 329-343.
187. G.-H. Lin, An improved approximation algorithm for multicast fc-tree routing, Journal of Combinatorial Optimization,9(4)(2005), 349-356.
188. G.-H. Lin and G.-L. Xue, Steiner tree problem with minimum number of Steiner points and bounded edge-length, Information Processing Letters, 69(2)(1999), 53-57.
189. G. -H. Lin and G.-L. Xue, On the terminal Steiner tree problem, Information Processing Letters,84(2)(2002), 103-107.
190. S. Lindsey, C, Raghavendra, and K. M. Sivalingam, Data gathering algorithms in sensor networks using energy metrics, IEEE Transactions on Parallel and Distributed Systems,13(9)(2002), 924-935.
191. A. Lingas, R. Y. Pinter, R. L. Rivest, and A. Shamir, Minimum edge length partitioning of rectilinear polygons, Proceedings of the 20th Allerton Conference on Communication, Control, and Computing,1982, pp. 53-63.
192. A. Lingas, Heuristics for minimum edge length rectangular partitions of rectilinear figures, Lecture Notes in Computer Science,1983, vol. 145, pp. 199-210.
193. p distance, Algo-rithmica,7(1)(1992), 179-191.
194. E. L. Lloyd and G.-L. Xue, Relay node placement in wireless sensor networks, IEEE Transactions on Computers,56(1)(2007), 134-138.
195. B. Lu, J. Gu, X.-D. Hu, and E. Shragowitz, Wire segmenting for buffer insertion based on RSTP-MSP, Theoretical, Computer Science,262(1-2)(2001), 257-267.
196. B. Lu and L. Ruan, Polynomial time approximation scheme for the rectilinear Steiner arborescence problem, Journal of Combinatoriall Optimization, 4(3)(2000), 357-363.
197. E. L. Luebke and J. S. Provan, On the structure and complexity of the 2-connected Steiner network problem in the plane. Operations Research Letters,26(3)(2000), 111-116.
198. D. G. Luenberger, Linear and Nonlinear Programming, Second edition, MA: Addison Wesley, 1984.
199. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of ACM,41(5)(1994), 960-981.
200. W. Mader, A reduction method for edge-connectivity in graphs, Annual of Discrete Mathematics,3(1978), 145-164.
201. I. I. Mandoiu and A. Z. Zelikovsky, A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points, Information Processing Letters,75(4)(2000), 165-167.
202. M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Bicriteria network design problems, Journal of Algorithms, 28(1)(1998), 142-171.
203. F. B. Martinez, J. C. Pina, and J. Soares, Algorithms for terminal Steiner trees, Lecture Notes in Computer Science, 2005, vol. 3595, pp. 369-379.
204. F. V. Martinez and B. J. Soares, Steiner trees with a terminal order, Pro-ceedings of the 15th International Conference on Computing (CIC), 2006, pp. 254-259.
205. N. F. Maxemchuk, Video distribution on multicast networks, IEEE Journal on Selected, Areas in Communications.15(3)(1997), 357-372.
206. Z. A. Melzak, On the problem of Steiner, Canadian Mathematical Bulletin, 4(1961), 143-148.
207. A. Meyerson, Online algorithms for network design, Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004, pp. 275-280.
208. G. L. Miller, S. H. Teng, W. Thurston, and S. A. Vavasis, Separators for sphere packings and nearest neighbor graphs, Journal of ACM,44(1)(1997), 1-29.
209. M. Min, H.-W. Du, X.-H. Jia, C. X. Huang, S. C.-H. Huang, and W.-L. Wu, Improving construction for connected dominating set with Steiner tree in wireless sensor networks, Journal of Global Optimization,35(1)(2006), 111-119.
210. P. Mirchandani, The multi-tier tree problem, INFORMS Journal on Computing,8(1996), 202-218.
211. J. S. B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k-MST problem, Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1996, pp. 402-408.
212. J. S. B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: Part III - Faster polynomial-time approximation scheme for geometric network optimization, Proceedings of the 9th Canadian Conference on Computational Geometry,1997, pp. 229-232.
213. J. S. B. Mitchell, A. Blum, P. Chalasani, and S. Vempala, A constant-factor approximation algorithm for the geometric fc-MST problem in the plane, SIAM Journal on Computing,28(3)(1999), 771-781.
214. J. S. B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: Part II - A simple polynomial-time approximation scheme for geometric k-MST, TSP, and related problem, SIAM Journal on Computing, 29(2)(1999), 515-544.
215. C. L. Monma, B. S. Munson, and W. R. Pulleyblank, Minimum-weight two-connected spanning networks, Mathematical Programing,46(1-3)(1990), 153-171.
216. A. Moss and Y. Rabani, Approximation algorithms for constrained node weighted Steiner tree problems, Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (STOC), 2001, pp. 373-382.
217. C. St. J. A. Nash-Williams, Edge disjoint spanning trees of finite graphs, The Journal of the London Mathematical Society,36(1961), 445-450.
218. T. Nishizeki and K. Kashiwagi, On the 1.1 edge-coloring of multigraphs, SIAM Journal on Discrete Mathematics,3(3)(1990), 391-410.
219. C. Nomikos, Path coloring in graphs, Ph.D Thesis, Department of Electrical and Computer Engineering, National Technical University of Athens, 1997.
220. C. Nomikos, Routing and path coloring in rings: NP-completeness, Tech-nical Report 15-2000, University of Ioannina, Greece, 2000.
221. C. Nomikos, A. Pagourtzis, and S. Zachos, Satisfying a maximum number of pre-routed requests in all-optical rings, Computer Networks,42(1)(2003), 55-63.
222. C. Nomikos and S. Zachos, Coloring a maximum number of paths in graphs, Workshop on Algorithmic Aspects of Communication,1997.
223. I. Papadimitriou and L. Georgiadis, Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree, Mobile Networks and Applications,11(3)(2006), 361-375.
224. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
225. H. O. Pollak, Some remarks on the Steiner problem. Journal of Combinatorial Theory (Ser. A), 24(3)(1978), 278-295.
226. R. C. Prim, Shortest connection networks and some generalizations, Bell System Technical Journal,36(1957), 1389-1401.
227. H. J. Promel and A. Steger, A new approximation algorithm for the Steiner tree problem with performance ratio 5/3, Journal of Algorithms, 36(1)(2000), 89-101.
228. H. J. Promel and A. Steger, The Steiner Tree Problem: A Tour Through Graphs, Algorithms and Complexity, Vieweg Verlag, Wiesbaden, 2002.
229. J. S. Provan, Two new criteria for finding Steiner hulls in Steiner tree problems, Algorithmica, 7(2-3)(1992), 289-302.
230. Y. Rabani, Path coloring on the mesh, Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), 1996, pp. 400-409.
231. P. Raghavan and E. Upfal, Efficient routing in all-optical networks, Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), 1994, pp. 134-143.
232. S. Rajagopalan and V. V. Vazirani, On the bidirected cut relaxation for the metric Steiner problem, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 742-751.
233. B. Ramamurthy, J. Iness, and B. Mukherjee, Minimizing the number of optical amplifiers needed to suppoort a multi-wavelength optical LAN/MAN, Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 1997, pp. 261-268.
234. S. B. Rao and W. D. Smith, Approximating geometrical graphs via “spanners” and “banyans”, Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), (1998), pp. 540-550.
235. R. Ravi, Rapid rumor ramification: approximating the minimum broadcast time, Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1994, pp. 202-213.
236. J. Remy and A. Steger, Approximation schemes for node-weighted geometric Steiner tree problems, Lecture Notes in Computer Science,2005, vol. 3624, pp. 221-232.
237. G. Robins and J. S. Salowe, Low-degree minimum spanning trees, Discrete Computing Geometry,14(1995), 151-165.
238. G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, Proceedings of ACM/SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 770-779.
239. G. Robins and A. Zelikovsky, Tighter bounds for graph Steiner tree approximation, SIAM Journal on Discrete Mathematics,19(1)(2005), 122-134.
240. J. H. Rubinstein and D. A. Thomas, A variational approach to the Steiner network problem, Annals of Operations Research,33(6)(1991), 481-499.
241. J. H. Rubinstein and D. A. Thomas, The Steiner ratio conjecture for six points, Journal of Combinatorial Theory (Ser. A), 58(1)(1991), 54-77.
242. L. H. Sahasrabuddhe and B. Mukherjee, Multicast routing algorithms and protocols: a tutorial, IEEE Network,14(1)(2000), 90-102.
243. L. H. Sahasrabuddhe and B. Mukherjee, Light-trees: optical multicasting for improved performance in wavelength-routed networks, IEEE Communications Magazine,37(2)(1999), 67-73.
244. M. Sarrafzadeh, W.-L. Lin, and C. K. Wong, Floating Steiner trees, IEEE Transactions on Computers,47(2)(1998), 197-211.
245. M. Sarrafzadeh and C. K. Wong, Bottleneck Steiner trees in the plane, IEEE Transactions on Computers,41(3)(1992), 370-374.
246. P. J. Slater, E. J. Cockayne, and S. T. Hedetniemi, Information dissemination in trees, SIAM Journal on Computing,10(4)(1981), 692-701.
247. W. D. Smith, How to find Steiner minimal trees in Euclidean d-space, Algorithmica, 7(1)(1992), 137-177.
248. J. M. Smith, D. T. Lee, and J. S. Liebman, An O(N log N) heuristic for Steiner minimal tree problems in the Euclidean metric, Networks, 11(1)(1981), 23-39.
249. J. M. Smith and J. S. Liebman, Steiner trees, Steiner circuits and interference problem in building design, Engineering Optimization, 4(1)(1979), 15-36.
250. I. Stewart, Trees, telephones and tiles, New Scientist, 16(1991), 26-29.
251. A. Suzuki and M. Iri, A heuristic method for euclidean Steiner problem as a geographical optimization problem, Asia-Pacific Journal of Operations Research, 3(1986), 106-122.
252. A. S. Tanenbaum, Computer Networks, Prentice Hall PTR, Upper Saddle River, NJ, 1996.
253. H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Mathematics Japonica, 24 (1980), 573-577.
254. R. Tarjan, Decomposition by clique separators, Discrete Mathematics, 55(2)(1985), 221-232.
255. M. Thimm, On the approximability of the Steiner tree problem, Lecture Notes in Computer Science,2001, vol. 2136, pp. 678-689.
256. W. T. Tutte, On the problem of decomposing a graph into n connected factors, The Journal of the London Mathematical Society,36(1961), 221-230.
257. V. V. Vazirani, Approximation Algorithms, Springer-Verlag Berlin Heidelberg, 2001.
258. P.-J. Wan, G. Cdlinescu, and C.-W. Yi, Minimum-power multicast routing in static ad hoc wireless networks, IEEE/ACM Transactions on Networking,12(3)(2004), 507-514.
259. P.-J. Wan, D.-Z. Du, and R. L. Graham, The Steiner ratio on the dual normed plane, Discrete Mathematics,171(1-3)(1997), 261-275.
260. P.-J. Wan and L. Liu, Maximal throughput in wavelength-routed optical networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science,46(1998), 15-26.
261. P.-J. Wan, G. Calinescu, X.-Y. Li, and O. Frieder, Minimum-energy broadcasting in static ad hoc wireless networks, Wireless Networks,8(6)(2002), 607-617.
262. L.-S. Wang and D.-Z. Du, Approximations for a bottleneck Steiner tree problem, Algorithmica, 32(4)(2002), 554-561.
263. L.-S. Wang and T. Jiang, An approximation scheme for some Steiner tree problems in the plane, Networks,28(4)(1996), 187-193.
264. L. Wang and Z. Li, An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane, Information Processing Letters,81(3)(2002), 151-156.
265. J.-P. Wang, X.-T. Qi, and B. Chen, Wavelength assignment for multicast in all-optical WDM networks with splitting constraints, IEEE/ACM Transactions on Networking,14(1)(2006), 169-182.
266. W.-Z. Wang, X.-Y. Li, and Z. Sun, Design differentiated service multicast with selfish agents, IEEE Journal on Selected Areas in Communications, 24(5)(2006), 1061-1073.
267. J. F. Weng, Steiner problem in hexagonal metric, Technical Report (unpublished).
268. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2000, pp. 585-594.
269. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, Energy-efficient broadcast and multicast trees in wireless networks, Mobile Netowrks and Applications,7(6)(2002), 481-492.
270. P. Winter and M. Zachariasen, Two-connected Steiner networks: structural properties, Operations Research Letters,33(44)(2005), 395-402.
271. Y. F. Wu, P. Widmayer, and C. K. Wong, A faster approximation algorithm for the Steiner problem in graphs, Acta Information,23(1986), 223-229.
272. G.-L. Xue, G.-H. Lin, and D.-Z. Du, Grade of serveice Steiner minimum trees in the Euclidean plane, Algorithmca,31(4)(2001), 479-500.
273. G.-L. Xue and W. Xiao, A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology, Algorithmica,41(1)(2004), 53-72.
274. G.-L. Xue and Y.-Y. Ye, An efficient algorithm for minimizing a sum of Euclidean norms with applications, SIAM Journal on Optimization, 7(4)(1997), 1017-1036.
275. A. Z. Zelikovsky, An 11/8-approximation algorithm for the Steiner problem on networks with rectilinear distance, Coll. Math. Soc. Janos Bolyai, 60(1992), 733-745.
276. A. Z. Zelikovsky, The 11/6-approximation algorithm for the Steiner problem on networks, Algorithmica,9(5)(1993), 463-470.
277. A. Z. Zelikovsky, Better approximation bounds for the network and Euclidean Steiner tree problems, Technical Report, CS-96-06, University of Virginia, Charlottesville, VA, USA.
278. A. Zelikovsky, A series of approximation algorithms for the acyclic directed Steiner tree problem, Algorithmica,18(1)(1997), 99-110.
279. A. Zelikovsky and I. Mandoiu, Practical approximation algorithms for zero- and bounded-skew trees, SIAM Journal on Discrete Mathematics, 15(1)(2002), 97-111.
280. Z.-M. Zhu, X.-J. Chen, and X.-D. Hu, Minimum multicast time problem in wireless sensor networks, Lecture Notes in Computer Science, 2006, vol. 4138, pp. 500-511.
281. Z.-M. Zhu, W.-P. Shang, and X.-D. Hu, New algorithm for minimum multicast time problem in wireless sensor networks, Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), 2007.