Polynomial time approximation schemes for minimum disk cover problems

Journal of Combinatorial Optimization

Volumn 20, Issue 4, 2010, Pages 399-412

  Liao, Chen ^a   Hu, Shiyan ^a  

^a Michigan Technological University   (United States)

Author keywords

Minimum disk cover; Minimum weight disk cover; Polynomial time approximation scheme; Wireless network

Indexed keywords

APPROXIMATION SCHEME; BEST-KNOWN ALGORITHMS; CARDINALITIES; CONSTANT FACTORS; COVER PROBLEM; EUCLIDEAN PLANES; MINIMUM DISK COVER; MINIMUM WEIGHT DISK COVER; NP-HARD; OPTIMAL SOLUTIONS; POLYNOMIAL TIME APPROXIMATION SCHEME; POLYNOMIAL TIME APPROXIMATION SCHEMES;

APPROXIMATION ALGORITHMS; DISKS (MACHINE COMPONENTS); OPTIMIZATION; POLYNOMIAL APPROXIMATION; WIRELESS NETWORKS;

DISKS (STRUCTURAL COMPONENTS);

EID: 78149279631     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-009-9216-y     Document Type: Article

References (17)

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, randomization, and combinatorial optimization, pp 3-14
2. BS Baker 1994 Approximation algorithms for np-complete problems on planar graphs J ACM 41 1 153 180 0807.68067 10.1145/174644.174650
3. H Bronnimann MT Goodrich 1995 Almost optimal set covers in finite VC-dimension Discrete Comput Geom 14 4 463 479 10.1007/BF02570718 1360948
4. G Calinescu II Mandoiu P-J Wan AZ Zelikovsky 2004 Selecting forwarding neighbors in wireless ad hoc networks ACM Mob Netw Appl 9 101 111 10.1023/B:MONE.0000013622.63511.57
5. X Cheng X Huang D Li W Wu D-Z Du 2003 A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks Networks 42 4 202 208 1031.05092 10.1002/net.10097 2016521
6. BN Clark CJ Colburn DS Johnson 1990 Unit disk graphs Discrete Math 86 165 177 0739.05079 10.1016/0012-365X(90)90358-O 1088569
7. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness
8. DS Hochbaum W Maass 1985 Approximation schemes for covering and packing problems in image processing and VLSI J ACM 32 1 130 136 0633.68027 10.1145/2455.214106 832335
9. Huang Y, Gao X, Zhang Z, Wu W (2008) A better constant-factor approximation for weighted dominating set in unit disk graph. J Comb Optim
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. DS Johnson 1982 NP-completeness columns: an onging guide J Algorithms 3 2 182 195 0494.68049 10.1016/0196-6774(82)90018-9 657274
12. S Masuyama T Ibaraki T Hasegawa 1981 The computational complexity of the m-center problems on the plane IEICE Trans E64 57 64
13. Ni S-Y, Tseng Y-C, Chen Y-S, Sheu J-P (1999) The broadcast storm problem in a mobile ad hoc network. In: Proceedings of the 5th ACM/IEEE international conference on mobile computing and networking, pp 151-162
14. T Nieberg J Hurink W Kern 2008 Approximation schemes for wireless networks ACM Trans Algorithms 4 4 49:1 49:17 10.1145/1383369.1383380 2446968
15. W Shang P Wan F Yao X Hu 2007 Algorithms for minimum m-connected k-tuple dominating set problem Theor Comput Sci 381 1-3 241 247 1188.68359 10.1016/j.tcs.2007.04.035 2347407
16. W Shang F Yao P Wan X Hu 2008 On minimum m-connected k-dominating set problem in unit disc graphs J Comb Optim 16 2 99 106 1160.05337 10.1007/s10878-007-9124-y 2415273
17. M-T Sun C-W Yi C-K Yang T-H Lai 2007 An optimal algorithm for the minimum disc cover problem Algorithmica 50 1 58 71 10.1007/s00453-007-9043-4 2366154