Practical discrete unit disk cover using an exact line-separable algorithm

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

Volumn 5878 LNCS, Issue , 2009, Pages 45-54

  Claude, Francisco ^a   Dorrigiv, Reza ^a   Durocher, Stephane ^b   Fraser, Robert ^a   López Ortiz, Alejandro ^a   Salinger, Alejandro ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; COVER PROBLEM; EXACT SOLUTION; MINIMUM SUBSETS; NP-HARD; PRACTICAL SOLUTIONS; TIME ALGORITHMS; UNIT DISK;

COMPUTATIONAL COMPLEXITY; DISKS (MACHINE COMPONENTS); DISKS (STRUCTURAL COMPONENTS);

APPROXIMATION ALGORITHMS;

EID: 75649094528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_7     Document Type: Conference Paper

References (17)

1. Agarwal, P., Procopiuc, C.: Exact and approximation algorithms for clustering. Alg. 33, 201-226 (2002)
2. Agarwal, P., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comp. Surv. 30, 412-458 (1998)
3. Ambühl, C., Erlebach, T., Mihal'ák, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proc. of Approx., Rand., and Comb. Opt. Alg. and Tech., pp. 3-14 (2006)
4. Carmi, P., Katz, M., Lev-Tov, N.: Covering points by unit disks of fixed location. In: Proc. Int'l Symp. on Alg. and Comp., pp. 644-655 (2007)
5. Clarkson, K., Varadarajan, K.: Improved approximation algorithms for geometric set cover. Disc. and Comp. Geom. 37(1), 43-58 (2007)
6. Cǎlinescu, G., Mǎndoiu, I., Wan, P.J., Zelikovsky, A.: Selecting forwarding neigh-bours in wireless ad hoc networks. Mob. Net. and Appl. 9(2), 101-111 (2004)
7. Fowler, R., Paterson, M., Tanimoto, S.: Optimal packing and covering in the plane are NP-complete. Inf. Proc. Lett. 12(3), 133-137 (1981)
8. Frederickson, G.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. on Comp. 16(6), 1004-1022 (1987)
9. Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130-136 (1985)
10. Hwang, R., Lee, R., Chang, R.: The generalized searching over separators strategy to solve some NP-hard problems in subexponential time. Alg. 9, 398-423 (1993)
11. Johnson, D.: The NP-completeness column: An ongoing guide. J. of Alg. 3(2), 182-195 (1982)
12. 1/6) time, parallel algorithm for solving planar Laplacians. In: Proc. Symp. Disc. Alg., pp. 1002-1011 (2007)
13. Lev-Tov, N.: Algorithms for Geometric Optimization Problems in Wireless Networks. Ph.D. thesis, Weizmann Institute of Science (2005)
14. Mustafa, N., Ray, S.: Improved results on geometric hitting set problems (2009), http://www.mpi-inf.mpg.de/~saurabh/Papers/Hitting-Sets.pdf
15. Mustafa, N., Ray, S.: PTAS for geometric hitting set problems via local search. In: Proc. Symp. on Comp. Geom., pp. 17-22 (2009)
16. Narayanappa, S., Voytechovsky, P.: An improved approximation factor for the unit disk covering problem. In: Proc. Can. Conf. Comp. Geom. (2006)
17. Supowit, K.: Topics in Computational Geometry. Ph.D. thesis, University of Illinois at Urbana-Champaign (1981)