Parameterized Exact and Approximation Algorithms for Maximum $k$-Set Cover and Related Satisfiability Problems

Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora

Given a family of subsets $\mathcal{S}$ over a set of elements~$X$ and two integers~$p$ and~$k$, Max k-Set Cover consists of finding a subfamily~$\mathcal{T}\subseteq \mathcal{S}$ of…