Covering Points by Unit Disks of Fixed Location

  • Paz Carmi
  • Matthew J. Katz
  • Nissan Lev-Tov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4835)

Abstract

Given a set \({\mathcal P}\) of points in the plane, and a set \({\mathcal D}\) of unit disks of fixed location, the discrete unit disk cover problem is to find a minimum-cardinality subset \({\mathcal D}' \subseteq {\mathcal D}\) that covers all points of \({\mathcal P}\). This problem is a geometric version of the general set cover problem, where the sets are defined by a collection of unit disks. It is still NP-hard, but while the general set cover problem is not approximable within \(c \log |{\mathcal P}|\), for some constant c, the discrete unit disk cover problem was shown to admit a constant-factor approximation. Due to its many important applications, e.g., in wireless network design, much effort has been invested in trying to reduce the constant of approximation of the discrete unit disk cover problem. In this paper we significantly improve the best known constant from 72 to 38, using a novel approach. Our solution is based on a 4-approximation that we devise for the subproblem where the points of \({\mathcal P}\) are located below a line l and contained in the subset of disks of \({\mathcal D}\) centered above l. This problem is of independent interest.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Computational Geometry 14, 463–479 (1995)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Calinescu, G., Mandoiu, I.I., Wan, P.-J., Zelikovsky, A.: Selecting forwarding neighbors in wireless ad hoc networks. MONET 9(2), 101–111 (2004)Google Scholar
  3. 3.
    Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. In: Proc. 21st ACM Sympos. Computational Geometry, pp. 135–141 (2005)Google Scholar
  4. 4.
    Gonzalez, T.: Covering a set of points in multidimensional space. Information Processing Letters 40, 181–188 (1991)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Hochbaum, D.S., Maas, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130–136 (1985)MATHCrossRefGoogle Scholar
  6. 6.
    Johnson, D.S.: The NP-completeness column: An ongoing guide. J. Algorithms 3, 182–195 (1982)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Lev-Tov, N.: Algorithms for Geometric Optimization Problems in Wireless Networks. Ph.D. Dissertation, Weizmann Institute of Science (2005)Google Scholar
  8. 8.
    Narayanappa, S., Vojtechovsky, P.: An improved approximation factor for the unit disk covering problem. In: Proc. 18th Canadian Conf. Computational Geometry, pp. 15–18 (2006)Google Scholar
  9. 9.
    Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. 29th ACM Sympos. Theory of Computing, pp. 475–484 (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Paz Carmi
    • 1
  • Matthew J. Katz
    • 2
  • Nissan Lev-Tov
    • 2
  1. 1.School of Computer Science, Carleton University, OttawaCanada
  2. 2.Department of Computer Science, Ben-Gurion University, Beer-ShevaIsrael

Personalised recommendations