A 5 + ε{lunate}-approximation algorithm for minimum weighted dominating set in unit disk graph

Theoretical Computer Science

Volumn 410, Issue 8-10, 2009, Pages 756-765

  Dai, Decheng ^a   Yu, Changyuan ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Approximation algorithm; Dominating set; Weighted unit disk graph

Indexed keywords

ALGORITHMS; DISKS (STRUCTURAL COMPONENTS); POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHM; APPROXIMATION RATIOS; CONNECTED DOMINATING SETS; CONSTANT-FACTOR APPROXIMATIONS; DOMINATING SET; DOMINATING SET PROBLEMS; MINIMUM WEIGHTS; POLYNOMIAL-TIME ALGORITHMS; WEIGHTED UNIT DISK GRAPH;

APPROXIMATION ALGORITHMS;

EID: 59049089756     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.11.015     Document Type: Article

References (13)

1. Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser, Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs, in: Proc. APPROX-RANDOM, 2006, pp. 3-14
2. Huang Y., Gao X., Zhang Z., and Wu W. A better constant-factor approximation for weighted dominating set in unit disk graph. J. Comb. Optim., 1382-6905 (2008) 1573-2886 (Print) (Online)
3. Lichtenstein D. Planar formulae and their uses. SIAM J. Comput. 11 2 (1982) 329-343
4. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, D.J. Rosenkrantz, Simple heuristics for unit disk graphs, Networks, 25, pp. 59-86
5. Hunt III H.B., Marathe M.V., Radhakrishman V., Ravi S.S., Rosenkrantz D.J., and Stearns R.E. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms 26 2 (1998) 238-274
6. Clark B.N., Colbourn C.J., and Johnson D.S. Unit disk graphs. Discrete Math. 86 1-3 (1990) 165-177
7. M.R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, ISBN: 0-7167-1044-7
8. Bar-Yehuda R., and Moran S. On approximation problems related to the independent set and vertex cover problem. Discrete Appl. Math. 9 (1984) 1-10
9. Vazirani V.V. Approximation Algorithms (2001), Springer
10. Uriel Feige, A Threshold of ln n for Approximating Set Cover, in: Proc. 28th ACM Symposium on Theory of Computing, 1996, pp. 314-318
11. Guha S., and Khuller S. Improved methods for approximation node weighted Steiner trees and connected dominating sets. Inform. Comput. 150 1 (1999) 57-74
12. Khaled M. Alzoubi, Pengjun Wan, Ophir Frieder, Message-optimal connected dominating sets in mobile ad hoc networks, in: Proceedings of the 3rd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, June 9-11, 2002, pp. 157-164
13. Jie Wu, Hailan Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, in: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Seattle, Washington, USA, August 20, 1999, pp. 7-14