Parameterized Complexity of Red Blue Set Cover for Lines

  • Pradeesha AshokEmail author
  • Sudeshna Kolay
  • Saket Saurabh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9644)


We investigate the parameterized complexity of Generalized Red Blue Set Cover (Gen-RBSC), a generalization of the classic Set Cover problem and the more recently studied Red Blue Set Cover problem. Given a universe U containing b blue elements and r red elements, positive integers \(k_\ell \) and \(k_r\), and a family \(\mathcal F \) of \(\ell \) sets over U, the Gen-RBSC problem is to decide whether there is a subfamily \(\mathcal F '\subseteq \mathcal F \) of size at most \(k_\ell \) that covers all blue elements, but at most \(k_r\) of the red elements. This generalizes Set Cover and thus in full generality it is intractable in the parameterized setting, when parameterized by \(k_\ell +k_r\). In this paper, we study Gen-RBSC-lines, where the elements are points in the plane and sets are defined by lines. We study this problem for the parameters \(k_\ell , k_r\), and \(k_\ell +k_r\). For all these cases, we either prove that the problem is W-hard or show that the problem is fixed parameter tractable (FPT). Finally, for the parameter \(k_\ell +k_r\), for which Gen-RBSC-lines admits FPT algorithms, we show that the problem does not have a polynomial kernel unless \(\text { co-NP}\subseteq \text { NP}/\mathrm{poly}\). Further, we show that the FPT algorithm does not generalize to higher dimensions.


Parameterized Complexity Polynomial Kernel Reduction Rule Blue Point Input Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423–434 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.V.: On the red-blue set cover problem. In: SODA, vol. 9, pp. 345–353 (2000)Google Scholar
  3. 3.
    Chan, T.M., Hu, N.: Geometric red-blue set cover for unit squares and related problems. In: CCCG (2013)Google Scholar
  4. 4.
    Ying Cheng, S., Iyengar, S., Kashyap, R.L.: A new method of image compression using irreducible covers of maximal rectangles. IEEE Trans. Software Eng. 14(5), 651–658 (1988)CrossRefGoogle Scholar
  5. 5.
    Dom, M., Guo, J., Niedermeier, R., Wernicke, S.: Red-blue covering problems and the consecutive ones property. J. Discrete Algorithms 6(3), 393–407 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors, ids. ACM Trans. Algorithms 11(2), 1–20 (2014)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity, p. 530. Springer-Verlag, Heidelberg (1999)CrossRefzbMATHGoogle Scholar
  8. 8.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Heidelberg (2006)zbMATHGoogle Scholar
  9. 9.
    Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct pcps for NP. J. Comput. Syst. Sci. 77(1), 91–106 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of a Symposium on the Complexity of Computer Computations, pp. 85–103 (1972)Google Scholar
  11. 11.
    Kratsch, S., Philip, G., Ray, S.: Point line cover: The easy kernel is essentially tight. In: SODA, pp. 1596–1606 (2014)Google Scholar
  12. 12.
    Kumar, V.S.A., Arya, S., Ramesh, H.: Hardness of set cover with intersection 1. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 624–635. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  13. 13.
    Langerman, S., Morin, P.: Covering things with things. Discrete Comput. Geom. 33(4), 717–729 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Levcopoulos, C.: Improved bounds for covering general polygons with rectangles. In: Nori, K.V. (ed.) FSTTCS 1987. LNCS, vol. 287, pp. 95–102. Springer, Heidelberg (1987)CrossRefGoogle Scholar
  15. 15.
    Marx, D.: Parameterized complexity of independence and domination on geometric graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 154–165. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Mathieson, L., Szeider, S.: The parameterized complexity of regular subgraph problems and generalizations. CATS 77, 79–86 (2008)Google Scholar
  17. 17.
    Peleg, D.: Approximation algorithms for the label-cover\({}_{\text{ max }}\) and red-blue set cover problems. J. Discrete Algorithms 5(1), 55–64 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52(2), 203–225 (2008)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Pradeesha Ashok
    • 1
    Email author
  • Sudeshna Kolay
    • 1
  • Saket Saurabh
    • 1
    • 2
  1. 1.Institute of Mathematical SciencesChennaiIndia
  2. 2.University of BergenBergenNorway

Personalised recommendations