On Partial Covering For Geometric Set Systems

Authors Tanmay Inamdar, Kasturi Varadarajan

Thumbnail PDF


  • Filesize: 0.52 MB
  • 14 pages

Document Identifiers

Author Details

Tanmay Inamdar
Kasturi Varadarajan

Cite AsGet BibTex

Tanmay Inamdar and Kasturi Varadarajan. On Partial Covering For Geometric Set Systems. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 47:1-47:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


We study a generalization of the Set Cover problem called the Partial Set Cover in the context of geometric set systems. The input to this problem is a set system (X, R), where X is a set of elements and R is a collection of subsets of X, and an integer k <= |X|. Each set in R has a non-negative weight associated with it. The goal is to cover at least k elements of X by using a minimum-weight collection of sets from R. The main result of this article is an LP rounding scheme which shows that the integrality gap of the Partial Set Cover LP is at most a constant times that of the Set Cover LP for a certain projection of the set system (X, R). As a corollary of this result, we get improved approximation guarantees for the Partial Set Cover problem for a large class of geometric set systems.
  • Partial Set Cover
  • Geometric Set Cover


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Boris Aronov, Esther Ezra, and Micha Sharir. Small-size ε-nets for axis-parallel rectangles and boxes. SIAM J. Comput., 39(7):3248-3282, 2010. Google Scholar
  2. Reuven Bar-Yehuda. Using homogeneous weights for approximating the partial cover problem. Journal of Algorithms, 39(2):137–144, 2001. Google Scholar
  3. Hervé Brönnimann and Michael T. Goodrich. Almost optimal set covers in finite vc-dimension. Discrete & Computational Geometry, 14(4):463-479, 1995. Google Scholar
  4. Nader H. Bshouty and Lynn Burroughs. Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. In STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pages 298-308, 1998. Google Scholar
  5. Timothy M. Chan. Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms, 46(2):178-189, 2003. Google Scholar
  6. Timothy M. Chan, Elyot Grant, Jochen Könemann, and Malcolm Sharpe. Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, pages 1576-1585, 2012. Google Scholar
  7. Timothy M. Chan and Nan Hu. Geometric red-blue set cover for unit squares and related problems. Comput. Geom., 48(5):380-385, 2015. Google Scholar
  8. Kenneth L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom., 2(1):195-222, 1987. Google Scholar
  9. Kenneth L. Clarkson and Kasturi Varadarajan. Improved approximation algorithms for geometric set cover. Discrete &amp; Computational Geometry, 37(1):43-58, 2007. Google Scholar
  10. Irit Dinur and David Steurer. Analytical approach to parallel repetition. In Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, STOC '14, pages 624-633, New York, NY, USA, 2014. ACM. Google Scholar
  11. Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, and Domagoj Severdija. Improved approximations for guarding 1.5-dimensional terrains. Algorithmica, 60(2):451-463, 2011. Google Scholar
  12. Thomas Erlebach and Erik Jan Van Leeuwen. Ptas for weighted set cover on unit squares. In Proceedings of the 13th International Conference on Approximation, and 14 the International Conference on Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX/RANDOM'10, pages 166-177, Berlin, Heidelberg, 2010. Springer-Verlag. Google Scholar
  13. Guy Even, Dror Rawitz, and Shimon (Moni) Shahar. Hitting sets when the vc-dimension is small. Inf. Process. Lett., 95(2):358-362, jul 2005. Google Scholar
  14. Esther Ezra, Boris Aronov, and Micha Sharir. Improved bound for the union of fat triangles. In Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '11, pages 1778-1785, Philadelphia, PA, USA, 2011. Society for Industrial and Applied Mathematics. Google Scholar
  15. Uriel Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, 1998. Google Scholar
  16. Toshihiro Fujito. On combinatorial approximation of covering 0-1 integer programs and partial set cover. Journal of Combinatorial Optimization, 8(4):439-452, 2001. Google Scholar
  17. Rajiv Gandhi, Samir Khuller, and Srinivasan Aravind. Approximation algorithms for partial covering problems. J. Algorithms, 53(1):55-84, 2004. Google Scholar
  18. Christian Glaßer, Christian Reitwießner, and Heinz Schmitz. Multiobjective disk cover admits a PTAS. In Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pages 40-51, 2008. Google Scholar
  19. Sathish Govindarajan, Rajiv Raman, Saurabh Ray, and Aniket Basu Roy. Packing and covering with non-piercing regions. In 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, pages 47:1-47:17, 2016. Google Scholar
  20. David Haussler and Emo Welzl. epsilon-nets and simplex range queries. Discrete & Computational Geometry, 2:127-151, 1987. Google Scholar
  21. Dorit S. Hochbaum. The t-vertex cover problem: Extending the half integrality framework with budget constraints. In Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX '98, pages 111-122, London, UK, UK, 1998. Springer-Verlag. Google Scholar
  22. Dorit S. Hochbaum and Wolfgang Maass. Approximation schemes for covering and packing problems in image processing and vlsi. J. ACM, 32(1):130-136, 1985. Google Scholar
  23. Michael J. Kearns. Computational Complexity of Machine Learning. MIT Press, Cambridge, MA, USA, 1990. Google Scholar
  24. Samir Khuller, Anna Moss, and Joseph Naor. The budgeted maximum coverage problem. Inf. Process. Lett., 70(1):39-45, 1999. Google Scholar
  25. James King and David Kirkpatrick. Improved approximation for guarding simple galleries from the perimeter. Discrete Comput. Geom., 46(2):252-269, 2011. Google Scholar
  26. Jochen Könemann, Ojas Parekh, and Danny Segev. A unified approach to approximating partial covering problems. Algorithmica, 59(4):489-509, 2011. Google Scholar
  27. Erik Krohn, Matt Gibson, Gaurav Kanade, and Kasturi R. Varadarajan. Guarding terrains via local search. JoCG, 5(1):168-178, 2014. Google Scholar
  28. Julián Mestre. A primal-dual approximation algorithm for partial vertex cover: Making educated guesses. Algorithmica, 55(1):227-239, 2009. Google Scholar
  29. Nabil H. Mustafa and Saurabh Ray. Improved results on geometric hitting set problems. Discrete &Computational Geometry, 44(4):883-895, 2010. Google Scholar
  30. Petr Slavík. Improved performance of the greedy algorithm for partial cover. Inf. Process. Lett., 64(5):251-254, dec 1997. Google Scholar
  31. Kasturi R. Varadarajan. Epsilon nets and union complexity. In Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pages 11-16, 2009. Google Scholar
  32. Kasturi R. Varadarajan. Weighted geometric set cover via quasi-uniform sampling. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 641-648, 2010. Google Scholar
  33. Vijay V. Vazirani. Approximation Algorithms. Springer-Verlag New York, Inc., New York, NY, USA, 2001. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail