Two constant approximation algorithms for node-weighted steiner tree in unit disk graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5165 LNCS, Issue , 2008, Pages 278-285

  Zou, Feng ^a   Li, Xianyue ^b   Kim, Donghyun ^a   Wu, Weili ^a  

^a The University of Texas at Dallas   (United States)

^b LANZHOU UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT APPROXIMATION ALGORITHMS; GRAPH G; INTERNATIONAL CONFERENCES; STEINER TREES; UNIT DISK GRAPHS;

BEVERAGES; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; OPTIMIZATION; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 52049083719     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85097-7_26     Document Type: Conference Paper

References (17)

1. Aneja, Y.P.: An integer linear programming approach to the Steiner problem in graphs. Networks 10, 167-178 (1980)
2. Beasley, J.E.: An algorithm for the Steiner problem in graphs. Networks 14, 147-159 (1984)
3. Berman, P., Ramaiyer, V.: Improved approximations for the Steiner tree problem. Journal of Algorithms 17, 381-408 (1994)
4. Chen, D., Du, D.Z., Hu, X.D., Lin, G.H., Wang, L., Xue, G.: Approximation for Steiner tree with minimum number of Steiner points. Theoretical Computer Science 262, 83-99 (2001)
5. Feige, U.: A threshold of lnn for approximating set cover. J. ACM 45, 634-652 (1998)
6. Garey, M.R., Johnson, D.S.: Computers and Intractability:A Guide to the Theory of NP-Completeness. Freeman, San Fransico (1978)
7. Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation 150, 57-74 (1999)
8. Hougardy, S., Prömel, H.J.: A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. SODA, 448-453 (1998)
9. Huang, Y., Gao, X., Zhang, Z., Wu, W.: A Better Constant-Factor Approximation for Weighted Dominating Set in Unit Disk Graph (preprint)
10. Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms 19, 104-115 (1995)
11. Kou, L.T., Markowsky, G., Berman, L.: A Fast Algorithm for Steiner Trees, pp. 141-145 (1981)
12. Min, M., Du, H., Jia, X., C.X.H, Huang, S.C.H., Wu, W.: Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks. Journal of Global Optimizatio 35, 111-119 (2006)
13. Moss, A., Rabani, Y.: Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems. In: STOC (2001)
14. Robins, G., Zelikovski, A.: Improved Steiner Tree Approximation in Graphs. In: Proc. of 11th. ACM-SIAM Symposium on Discrete. Algorithms, pp. 770-779 (2000)
15. Segev, A.: The node-weighted steiner tree problem. Networks 17, 1-17 (1987)
16. Shore, M.L., Foulds, L.R., Gibbons, R.B.: An algorithm for the Steiner problem in graphs. Networks 12, 323-333 (1982)
17. Zelikovsky, A.: An 11/6 approximation algorithm for the network Steiner problem. Algorithmica 9, 463-470 (1993)