Advertisement

Maximum Independent and Disjoint Coverage

  • Amit Kumar Dhar
  • Raghunath Reddy Madireddy
  • Supantha PanditEmail author
  • Jagpreet Singh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11436)

Abstract

Set Cover is one of the most studied optimization problems in Computer Science. In this paper, we target two interesting variations of this problem in a geometric setting: (i) Open image in new window , and (ii) Open image in new window problems. In both problems, the input consists of a set P of points and a set O of geometric objects in the plane. The objective is to maximize the number of points covered by a set \(O'\) of selected objects from O. In the MDC problem we restrict the objects in \(O'\) are pairwise disjoint (non-intersecting). Whereas, in the MIC problem any pair of objects in \(O'\) should not share a point from P (however, they may intersect each other). We consider various geometric objects as covering objects such as axis-parallel infinite lines, axis-parallel line segments, unit disks, axis-parallel unit squares, and intervals on a real line. For axis-parallel infinite lines both MDC and MIC problems admit polynomial time algorithms. On the other hand, we prove that the MIC problem is \(\mathsf {NP}\)-complete when the objects are horizontal infinite lines and vertical segments. We also prove that both MDC and MIC problems are \(\mathsf {NP}\)-complete for axis-parallel unit segments in the plane. For unit disks and axis-parallel unit squares, we prove that both these problems are \(\mathsf {NP}\)-complete. Further, we present \(\mathsf {PTAS}\)es for the MDC problem for unit disks as well as unit squares using Hochbaum and Maass’s “shifting strategy”. For unit squares, we design a \(\mathsf {PTAS}\) for the MIC problem using Chan and Hu’s “mod-one transformation” technique. In addition to that, we give polynomial time algorithms for both MDC and MIC problems with intervals on the real line.

Keywords

Set cover Maximum coverage Independent set \(\mathsf {NP}\)-hard \(\mathsf {PTAS}\) Line Segment Disk Square 

References

  1. 1.
    Adamaszek, A., Wiese, A.: Approximation schemes for maximum weight independent set of rectangles. In: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013, pp. 400–409 (2013)Google Scholar
  2. 2.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc., Upper Saddle River (1993)zbMATHGoogle Scholar
  3. 3.
    Chan, T.M., Grant, E.: Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. 47(2), 112–124 (2014)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discrete Comput. Geom. 48(2), 373–392 (2012)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Chan, T.M., Hu, N.: Geometric red-blue set cover for unit squares and related problems. Comput. Geom. 48(5), 380–385 (2015)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1), 165–177 (1990)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 34(6), 1302–1323 (2005)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Erlebach, T., van Leeuwen, E.J.: Approximating geometric coverage problems. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 1267–1276 (2008)Google Scholar
  9. 9.
    Feige, U.: A threshold of \(\ln n\) for approximating set cover. J. ACM 45(4), 634–652 (1998)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130–136 (1985)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Ito, T., et al.: A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. 544, 14–31 (2014)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Ito, T., et al.: A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. 51, 25–39 (2016)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Kleinberg, J., Tardos, E.: Algorithm Design. Addison Wesley, Boston (2006)Google Scholar
  14. 14.
    Madireddy, R.R., Mudgal, A., Pandit, S.: Hardness results and approximation schemes for discrete packing and domination problems. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) COCOA 2018. LNCS, vol. 11346, pp. 421–435. Springer, Cham (2018).  https://doi.org/10.1007/978-3-030-04651-4_28Google Scholar
  15. 15.
    Mehrabi, S.: Geometric unique set cover on unit disks and unit squares. In: Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, pp. 195–200 (2016)Google Scholar
  16. 16.
    Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2), 11:1–11:29 (2008)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Nandy, S.C., Pandit, S., Roy, S.: Covering points: Minimizing the maximum depth. In: Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, pp. 37–42 (2017)Google Scholar
  18. 18.
    Nieberg, T., Hurink, J., Kern, W.: A robust PTAS for maximum weight independent sets in unit disk graphs. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 214–221. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-30559-0_18zbMATHGoogle Scholar
  19. 19.
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216–226. ACM, New York (1978)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Amit Kumar Dhar
    • 1
  • Raghunath Reddy Madireddy
    • 2
  • Supantha Pandit
    • 3
    Email author
  • Jagpreet Singh
    • 4
  1. 1.Department of Electrical Engineering and Computer ScienceIndian Institute of Technology BhilaiDatrengaIndia
  2. 2.Department of Computer Science and EngineeringIndian Institute of Technology RoparRupnagarIndia
  3. 3.Stony Brook UniversityStony BrookUSA
  4. 4.Department of Information TechnologyIndian Institute of Information Technology AllahabadAllahabadIndia

Personalised recommendations