A better constant-factor approximation for weighted dominating set in unit disk graph

Journal of Combinatorial Optimization

Volumn 18, Issue 2, 2009, Pages 179-194

  Huang, Yaochun ^a   Gao, Xiaofeng ^a   Zhang, Zhao ^b   Wu, Weili ^a  

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

^b XINJIANG UNIVERSITY   (China)

Author keywords

Connected dominating set; Unit disk graph; Wireless network

Indexed keywords

APPROXIMATION RATIOS; CONNECTED DOMINATING SET; CONSTANT FACTOR APPROXIMATION; DOMINATING SETS; MINIMUM WEIGHT; POSITIVE NUMBERS; SECOND PHASE; SUBGRAPHS; TWO PHASIS; UNIT DISK GRAPH; UNIT DISK GRAPHS;

DISKS (STRUCTURAL COMPONENTS); SET THEORY; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 72449197094     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-008-9146-0     Document Type: Article

References (15)

1. Ambühl C, Erlebach T, Mihalák M, Nunkesser M (2006) Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2006). LNCS, vol 4110. Springer, Berlin, pp 3-14
2. BS Baker 1994 Approximation algorithms for NP-complete problems on planar graphs J Assoc Comput Mach 41 1 153 180 0807.68067 1369197
3. R Bar-Yehuda S Moran 1984 On approximation problems related to the independent set and vertex cover problem Discrete Appl Math 9 1 10 0554.68026 10.1016/0166-218X(84)90086-6 754424 (Pubitemid 15427538)
4. BN Clark CJ Colbourn DS Johnson 1990 Unit disk graphs Discrete Math 86 165 177 0739.05079 10.1016/0012-365X(90)90358-O 1088569
5. WF Dai M Gao I Stojmenovic 2002 On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks J Commun Netw 4 1 59 70
6. Feige U (1996) A Threshold of lnn for approximating set cover. In: Proc. 28th ACM symposium on theory of computing. ACM, New York, pp 314-318
7. Garey MR, Johnson DS (1979) Computers and intractability. In: A guide to the theory of NP completeness. Freeman, New York
8. S Guha S Khuller 1999 Improved methods for approximating node weighted Steiner trees and connected dominating sets Inf Comput 150 1 57 74 10.1006/inco.1998.2754 1681706
9. DS Hochbaum W Maass 1985 Approximation schemes for covering and packing problems in image processing and VLSI J Assoc Comput Mach 32 1 130 136 0633.68027 832335
10. HB Hunt III MV Marathe V Radhakrishnan SS Ravi DJ Rosenkrantz RE Stearns 1998 NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs J Algorithms 26 2 238 274 0894.68105 10.1006/jagm.1997.0903 1606504
11. D Lichtenstein 1982 Planar formulae and their uses SIAM J Comput 11 2 329 343 0478.68043 10.1137/0211025 652906
12. MV Marathe H Breu HB Hunt III SS Ravi DJ Rosenkrantz 1995 Simple heuristics for unit disk graphs Networks 25 59 68 0821.90128 10.1002/net.3230250205 1321110
13. Vazirani VV (2001) Approximation algorithms. Springer, Berlin
14. Wang Y, Li XY (2005) Distributed low-cost backbone formation for wireless ad hoc networks. In: Proceedings of the 6th ACM international symposium on mobile ad hoc networking and computing (MobiHoc 2005), pp 2-13
15. Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad-hoc wireless networks. In: Proc. of the 3rd international workshop on discrete algorithms and methods for mobile computing and commun, pp 7-14