On Fair Covering and Hitting Problems

[1]  Ola Svensson,et al.  Fair colorful k-center clustering , 2020, Mathematical Programming.

[2]  Zsolt Tuza,et al.  Tropical matchings in vertex-colored graphs , 2017, Electron. Notes Discret. Math..

[3]  V. S. Anil Kumar,et al.  Hardness of Set Cover with Intersection 1 , 2000, ICALP.

[4]  Amit Kumar,et al.  Approximation algorithms for the partition vertex cover problem , 2013, Theor. Comput. Sci..

[5]  Stefan Kratsch,et al.  Point Line Cover , 2013, ACM Trans. Algorithms.

[6]  Rico Zenklusen,et al.  A technique for obtaining true approximations for k-center with covering constraints , 2020, Mathematical Programming.

[7]  Refael Hassin,et al.  Approximation algorithms for hitting objects with straight lines , 1991, Discret. Appl. Math..

[8]  Dieter van Melkebeek,et al.  Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses , 2014, JACM.

[9]  Pat Morin,et al.  Covering Things with Things , 2005, Discret. Comput. Geom..

[10]  Petr Slavík.  Improved Performance of the Greedy Algorithm for Partial Cover , 1997, Inf. Process. Lett..

[11]  Dániel Marx,et al.  Kernelization of packing problems , 2012, SODA.

[12]  Ojas Parekh,et al.  Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs , 2017, SIAM J. Discret. Math..

[13]  Sariel Har-Peled,et al.  On Separating Points by Lines , 2017, Discrete & Computational Geometry.

[14]  Nimrod Megiddo,et al.  On the complexity of locating linear facilities in the plane , 1982, Oper. Res. Lett..