Approximation algorithms for the discrete piercing set problem for unit disks

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

Volumn , Issue , 2011, Pages

  De, Minati ^a   Das, Gautam K ^b   Nandy, Subhas C ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RESULTS; CONSTANT FACTORS; POLYNOMIAL-TIME; SET PROBLEMS; UNIT DISK;

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION;

COMPUTATIONAL GEOMETRY;

EID: 84882952038     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. C. Ambuhl, T. Erlebach, M. Mihalak and M. Numkesser. Constant-factor approximation for minimum-weight (connect) dominating sets in unit disk graphs. Proc. of the APPROX-RANDOM, pp. 3-14, 2006.
2. G. Calinescu, I Mandoiu, P. J. Wan and A. Zelikovsky. Selecting forwarding neighbors in wireless ad hoc networks. Mobile Network Applications, 9(2):101-111, 2004.
3. P. Carmi, M. Katz and N. Lev-Tov. Covering points by unit disks of fixed location. Proc. of the 18th. Interna- tional Symposium on Algorithms and Computation, pp. 644-655, 2007.
4. P. Carmi, M. J. Katz and N. Lev-Tov. Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. Computational Geometry: Theory and Applications, 39(3):209-218, 2008.
5. T. M. Chan. Polynomial-time approximation schemes for packing and piercing fat objects. Journal of Algorithms, 46(2):178-189, 2003.
6. T. M. Chan and A. -A. Mahmood. Approximating the piercing umber of unit height rectangles. Proc. of the 17th. Canadian Conference on Computational Geometry, pp. 15-18, 2005.
7. B. N. Clark, C. J. Colbourn and D. S. Johnson. Unit disk graphs. Discrete Math., 86(1):165-177, 1990.
8. F. Claude, G. K. Das, R. Dorrigiv, S. Durochar, R. Fraser, A. Lopez-Ortiz and B. G. Nickerson. An improved line-separable algorithm for discrete unit disk cover. Discrete Mathematics, Algorithms and Applications, 2(1):77-87, 2010.
9. M. R. Cerioli, L. Faria, T. O. Ferreira and F. Protti. On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. Electronic Notes in Discrete Mathematics, 18:73-79, 2004.
10. G. K. Das, R. Fraser, A. Lopez-Ortiz and B. G. Nickerson. On the discrete unit disk cover problem. Proc. of the 5th. Workshop on Algorithm and Computation, LNCS-6552, pp. 146-157, 2011.
11. D. Dai and C. Yu. A (5 + ε)-approximation algorithm for minimum weighted dominating set in unit disk graph. Theoretical Computer Science, 410(8-10):756- 765, 2009.
12. A. Dumitrescu and J. Pach. Minimum clique partition in unit disk graphs. Graphs and Combinatorics, 27(3):399-411, 2011.
13. T. Feder and D. H. Greene. Optimal algorithms for approximate clustering. Proc. of the 20th ACM Symposium on Theory of Computing, pp. 434-444, 1988.
14. T. F. Gonzalez. Covering a set of points in multidimensional space. Information Processing Letters, 40(4):181- 188, 1991.
15. Y. Huang, X. Gao, Z. Zhang and W. Wu. A better constant-factor approximation for weighted dominating set in unit disk graph. Journal of Combinatorial Optimization, 18(2):179-194, 2008.
16. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32(1):130- 136, 1985.
17. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP- completeness. Freeman, New York, 1979.
18. D. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 3(2):182-195, 1982.
19. M. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi and D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25(2):59-68, 1995.
20. T. Nieberg and J. Hurink. A PTAS for the minimum dominating set problem in unit disk graphs. Proc. of the 3rd International Workshop on Approximation and Online Algorithms, LNCS - 3879, pp. 296-306, 2006.
21. S. Narayanappa and P. Voytechovsky. An improved approximation factor for the unit disk covering problem. Proc. of the 18th Canadian Conference on Computational Geometry, 2006.
22. I. Pirwani and M. Salavatipour. A weakly robust PTAS for minimum clique partition in unit disk graphs. Proc. of the 12th Scandinavian Symposium and Workshops on Algorithm Theory, LNCS-6139, pp. 188-199, 2010.
23. F. Zou, Y. Wang, X. -H. Xu, X. Li, H. Du, P. Wan and W. Wu. New approximations for minimum- weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theoretical Computer Science, 412(3):198-208, 2011.