Parameterized Complexity of Conflict-Free Set Cover

Set Cover is one of the well-known classical NP-hard problems. 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 G_F 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 G_F. We study conflict-free Set Cover 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 the running time of conflict-free version of Set Cover with and without duplicate sets along with restrictions to the graph classes of G_F. For example, when pairs of sets in F intersect in at most one element, for a solution of size k, we give an f(k) | F| ^o(k) lower bound for any computable function f assuming ETH even if G_F is bipartite, butan O∗(3k2) FPT algorithm (O^∗ notation ignores polynomial factors of input) when G_F is chordal.