On the discrete unit disk cover problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6552 LNCS, Issue , 2011, Pages 146-157

  Das, Gautam K ^a   Fraser, Robert ^b   Lòpez Ortiz, Alejandro ^b   Nickerson, Bradford G ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTOR; CARDINALITIES; CONSTANT FACTOR APPROXIMATION; COVER PROBLEM; FACTOR APPROXIMATION ALGORITHMS; NP-HARD; RUNNING TIME; SET COVER PROBLEM; UNIT DISK;

APPROXIMATION ALGORITHMS;

EID: 79952275581     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19094-0_16     Document Type: Conference Paper

References (18)

1. Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica 33, 201-226 (2002)
2. Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Computing Serveys 30, 412-458 (1998)
3. de Berg, M., Kreveld, M.V., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (1997)
4. Brönnimann, H., Goodrich, M.: Almost optimal set covers in finite VC-dimension. Disc. and Comp. Geom. 14(1), 463-479 (1995)
5. Claude, F., Das, G.K., Dorrigiv, R., Durocher, S., Fraser, R., Lopez-Ortiz, A., Nickerson, B.G., Salinger, A.: An improved line-separable algorithm for discrete unit disk cover. Disc. Math., Alg. and Appl. 2, 77-87 (2010)
6. Cǎlinescu, G., Mǎndoiu, I., Wan, P.J., Zelikovsky, A.: Selecting forwarding neighbours in wireless ad hoc networks. Mobile Networks and Applications 9, 101-111 (2004)
7. Carmi, P., Katz, M.J., Lev-Tov, N.: Covering points by unit disks of fixed location. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 644-655. Springer, Heidelberg (2007)
8. Chvátal, V.: A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research 4(3), 233-235 (1979)
9. Fowler, R., Paterson, M., Tanimoto, S.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12, 133-137 (1981)
10. Frederickson, G.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. on Computing 16, 1004-1022 (1987)
11. Gonzalez, T.: Covering a set of points in multidimensional space. Information Processing Letters 40, 181-188 (1991)
12. Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130-136 (1985)
13. Hwang, R., Lee, R., Chang, R.: The generalized searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica 9, 398-423 (1993)
14. Johnson, D.S.: The NP-completeness column:An ongoing guide. J. Algorithms 3, 182-195 (1982)
15. 1/6) time, parallel algorithm for solving planar Laplacians. In: Proc. of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1002-1011 (2007)
16. Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discrete and Computational Geometry 44(4), 883-895 (2010)
17. Narayanappa, S., Vojtechovsky, P.: An improved approximation factor for the unit disk covering problem. In: Proc. of the 18th Canadian Conference on Computational Geometry, pp. 15-18 (2006)
18. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. of the 29th ACM Symposium on Theory of Computing, pp. 475-484 (1997)