Parameterized complexity of conflict-free set cover

Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


Set Cover is one of the well-known classical NP-hard problems. Following some recent trends, we study the conflict-free version of the Set Cover problem. Here we have a universe U, a family F of subsets of U and a graph GF on the vertex set F and we look for a subfamily F⊆ F of minimum size that covers U and also forms an independent set in GF. Here we initiate a systematic study of the problem in parameterized complexity by restricting the focus to the variants where Set Cover is fixed-parameter tractable (FPT). We give upper bounds and lower bounds for conflict-free version of the Set Cover with and without duplicate sets along with restrictions to the graph classes of GF.

Original languageEnglish
Title of host publicationComputer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings
EditorsRené van Bevern, Gregory Kucherov
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783030199548
StatePublished - 1 Jan 2019
Externally publishedYes
Event14th International Computer Science Symposium in Russia, CSR 2019 - Novosibirsk, Russian Federation
Duration: 1 Jul 20195 Jul 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11532 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference14th International Computer Science Symposium in Russia, CSR 2019
Country/TerritoryRussian Federation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Parameterized complexity of conflict-free set cover'. Together they form a unique fingerprint.

Cite this