Node-weighted Steiner tree approximation in unit disk graphs

Journal of Combinatorial Optimization

Volumn 18, Issue 4, 2009, Pages 342-349

  Zou, Feng ^a   Li, Xianyue ^b   Gao, Suogang ^c   Wu, Weili ^a  

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

^b LANZHOU UNIVERSITY   (China)

^c HEBEI NORMAL UNIVERSITY   (China)

Author keywords

Approximation algorithm; Node weighted Steiner tree; Unit disk graphs

Indexed keywords

FORESTRY; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

CONNECTED DOMINATING SET; CONNECTED VERTEX COVER; MINIMUM TOTAL WEIGHTS; POLYNOMIAL TIME APPROXIMATION; POLYNOMIAL-TIME ALGORITHMS; STEINER MINIMUM TREES; STEINER TREES; UNIT DISK GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 78651246913     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-009-9229-6     Document Type: Article

References (18)

1. Aneja YP (1980) An integer linear programming approach to the Steiner problem in graphs. Networks 10:167-178
2. Bar-Yehuda R, Even S (1985) A local-ratio theorem for approximating the weighted vertex cover problem. Anal Des Algorithms Comb Probl 25:27-46
3. Beasley JE (1984) An algorithm for the Steiner problem in graphs. Networks 14:147-159
4. Berman P, Ramaiyer V (1994) Improved approximations for the Steiner tree problem. J Algorithms 17:381-408
5. Chen D, Du DZ, Hu XD, Lin GH, Wang L, Xue G (2001) Approximation for Steiner tree with minimum number of Steiner points. Theor Comput Sci 262:83-99
6. Feige U (1998) A threshold of lnn for approximating set cover. J ACM 45:634-652
7. Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Fransisco
8. Guha S, Khuller S (1999) Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf Comput 150:57-74
9. Halperin E (2000) Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms. ACMSIAM, New York
10. Hougardy S, Prömel HJ (1998) A 1.598 approximation algorithm for the Steiner problem in graphs. In: SODA, pp 448-453
11. Huang Y, Gao X, Zhang Z,WuW(2009) A better constant-factor approximation for weighted dominating set in unit disk graph. Preprint
12. Klein P, Ravi R (1995) A nearly best-possible approximation algorithm for node-weighted Steiner trees. J Algorithms 19:104-115
13. Kou LT, Markowsky G, Berman L (1981) In: A fast algorithm for Steiner trees, pp 141-145
14. Nieberg T, Hurink J (2005) A PTAS for the minimum dominating set problem in unit disk graphs. In: WAOA, pp 296-306
15. Robins G, Zelikovski A (2000) Improved Steiner tree approximation in graphs. In: Proceedings of the 11th ACM-SIAM symposium on discrete algorithms, pp 770-779
16. Segev A (1987) The node-weighted Steiner tree problem. Networks 17:1-17
17. Shore ML, Foulds LR, Gibbons RB (1982) An algorithm for the Steiner problem in graphs. Networks 12:323-333
18. Zelikovsky A (1993) An 11/6 approximation algorithm for the network Steiner problem. Algorithmica 9:463-470