AN IMPROVED LINE-SEPARABLE ALGORITHM for DISCRETE UNIT DISK COVER

Discrete Mathematics, Algorithms and Applications

Volumn 2, Issue 1, 2010, Pages 77-87

  Claude, Francisco ^a   Das, Gautam K ^b   Dorrigiv, Reza ^a   Durocher, Stephane ^c   Fraser, Robert ^a   López Ortiz, Alejandro ^a   Nickerson, Bradford G ^c   Salinger, Alejandro ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

^c UNIVERSITY OF MANITOBA   (Canada)

Author keywords

approximation algorithm; Discrete unit disk cover; disk stabbing

Indexed keywords

EID: 79952270766     PISSN: 17938309     EISSN: 17938317     Source Type: Journal    
DOI: 10.1142/S1793830910000486     Document Type: Article

References (21)

1. P. Agarwal and C. Procopiuc, Exact and approximation algorithms for clustering, Alg. 33 (2002) 201-226.
2. P. Agarwal and M. Sharir, Efficient algorithms for geometric optimization, ACM Comp. Surv. 30 (1998) 412-458.
3. C. Ambühl, T. Erlebach, M. Mihal'ák and M. Nunkesser, Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs, in Proc. of Approx. Rand. Comb. Opt. Alg. and Tech. (2006), pp. 3-14.
4. G. Čalinescu, I. Mandoiu, P. J. Wan and A. Zelikovsky, Selecting forwarding neighbours in wireless ad hoc networks, Mob. Net. Appl. 9 (2004) 101-111.
5. P. Carmi, M. Katz and N. Lev-Tov, Covering points by unit disks of fixed location, in Proc. Int'l Symp. on Alg. and Comp. (2007), pp. 644-655.
6. K. Clarkson and K. Varadarajan, Improved approximation algorithms for geometric set cover, Disc. Comp. Geom. 37 (2007) 43-58.
7. F. Claude, R. Dorrigiv, S. Durocher, R. Fraser, A. López-Ortiz and A. Salinger, Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm, in Proc. Int'l Symp. Algs. Comp. (2009).
8. G. K. Das, S. Das and S. C. Nandy, Homogeneous 2-hop broadcast in 2D, Comp. Geom.: Theory and Appl. 43 (2010) 182-190.
9. R. Fowler, M. Paterson and S. Tanimoto, Optimal packing and covering in the plane are NP-complete, Inf. Proc. Lett. 12 (1981) 133-137.
10. G. Frederickson, Fast algorithms for shortest paths in planar graphs, with applications, SIAM J. Comp. 16 (1987) 1004-1022.
11. T. Gonzalez, Covering a set of points in multidimensional space, Inf. Proc. Lett. 40 (1991) 181-188.
12. D. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, J. ACM 32 (1985) 130-136.
13. R. Hwang, R. Lee and R. Chang, The generalized searching over separators strategy to solve some NP-hard problems in subexponential time, Alg. 9 (1993) 398-423.
14. D. Johnson, The NP-completeness column: An ongoing guide, J. of Alg. 3 (1982) 182-195.
15. I. Koutis and G. Miller, A linear work, o(n1/6) time, parallel algorithm for solving planar Laplacians, in Proc. Symp. Disc. Alg. (2007), pp. 1002-1011.
16. N. Lev-Tov, Algorithms for Geometric Optimization Problems in Wireless Networks, Ph.D. thesis, Weizmann Institute of Science (2005).
17. N. Mustafa and S. Ray, PTAS for geometric hitting set problems via local search, in Proc. Symp. on Comp. Geom. (2009), pp. 17-22.
18. N. Mustafa and S. Ray, Improved results on geometric hitting set problems, www.mpiinf. mpg.de/~saurabh/Papers/Hitting-Sets.pdf (2009).
19. S. Narayanappa and P. Voytechovsky, An improved approximation factor for the unit disk covering problem, in Proc. Can. Conf. on Comp. Geom. (2006).
20. R. Raz and S. Safra, A sub-constant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP, in Proc. ACM Symp. on Theory of Comp. (1997), pp. 475-484.
21. K. Supowit, Topics in Computational Geometry, Ph.D. thesis, University of Illinois at Urbana-Champaign (1981).