New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs

Theoretical Computer Science

Volumn 412, Issue 3, 2011, Pages 198-208

  Zou, Feng ^a   Wang, Yuexuan ^b   Xu, Xiao Hua ^c   Li, Xianyue ^d   Du, Hongwei ^c   Wan, Pengjun ^c   Wu, Weili ^a  

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

^b TSINGHUA UNIVERSITY   (China)

^c Illinois Institute of Technology   (United States)

^d LANZHOU UNIVERSITY   (China)

Author keywords

Approximation algorithm; Minimum weighted chromatic disk cover; Minimum weighted connected dominating set; Minimum weighted dominating set; Node weighted Steiner tree; Polynomial time approximation scheme

Indexed keywords

CONNECTED DOMINATING SET; DOMINATING SETS; MINIMUM-WEIGHTED CHROMATIC DISK COVER; POLYNOMIAL-TIME APPROXIMATION SCHEME; STEINER TREES;

AD HOC NETWORKS; DISKS (STRUCTURAL COMPONENTS); DYNAMIC PROGRAMMING; MOBILE TELECOMMUNICATION SYSTEMS; MOLECULAR WEIGHT DISTRIBUTION; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 78650618678     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.06.022     Document Type: Conference Paper

References (17)

1. C. Ambhl, T. Erlebach, M. Mihalk, and M. Nunkesser Constant-factor approximation for minimum-weight (connect) dominating sets in unit disk graphs Lecture Notes in Computer Science 4110 2006 3 14
2. B.S. Baker Approximation algorithm for NP-complete problems on planar graphs Journal of the ACM 41 1994 153 180
3. D. Chen, D.Z. Du, X.D. Hu, G.H. Lin, L. Wang, and G. Xue Approximation for Steiner trees with minimum number of Steiner points Theoretical Computer Science 262 2001 83 99 (Pubitemid 32672735)
4. B. Das, V. Bharghavan, Routing in ad hoc networks using minimum connected dominating sets, in: International Conference on Communications, 1997
5. D. Dai, and C. Yu A (5 + ε ) -approximation algorithm for minimum weighted dominating set in unit disk graph Theoretical Computer Science 2009
6. M.R. Garey, and D.S. Johnson Computers and Intractability. A Guide to the Theory of NP-Completeness 1979 Freeman New York
7. S. Guha, and S. Khuller Improved methods of approximating node weighted Steiner tree and connected dominating sets Information and Computation 150 1999 57 74
8. D.S. Hochbaum, and W. Maass Approximation schemes for covering and packing problems in image processing and VLSI Journal of the ACM 32 1985 130 136
9. Y. Huang, X. Gao, Z. Zhang, and W. Wu A better constant-factor approximation for weighted dominating set in unit disk graph Journal of Combinatorial Optimization 2008
10. F.K. Hwang, and D.S. Richards Steiner tree problems Networks 22 1992 55 89
11. D. Lichtenstein Planar formulae and their uses SIAM Journal on Computing 11 1982 329 343
12. S. Ni, Y. Tseng, Y. Chen, J. Sheu, The broadcast storm problem in a mobile ad hoc network, in: MOBICOM'99, Washington, USA, August 1999, pp. 152162
13. G. Robins, J.S. Salowe, On the maximum degree of minimum spanning trees, in: Proceedings of the ACM Symposium on Computational Geometry, 1994, pp. 250258
14. L. Wang, and T. Jiang An approximation scheme for some Steiner tree problem in the plane Networks 28 1996 187 193 (Pubitemid 126330472)
15. W. Wu, H. Du, X. Jia, Y. Li, and S.C.H. Huang Minimum connected dominating sets and maximal independent sets in unit disk graphs Theoretical Computer Science 352 2006 1 7
16. F. Zou, X. Li, D. Kim, and W. Wu Node-weighted Steiner tree approximation in unit disk graphs Journal of Combination Optimization 2009
17. Z. Zhang, Y. Huang, X. Gao, and W. Wu A better constant-factor approximation for weighted dominating set in unit disk graphs Journal of Combinatorial Optimization 2008 1573 2886