3 research outputs found
Parameterized Exact and Approximation Algorithms for Maximum -Set Cover and Related Satisfiability Problems
Given a family of subsets over a set of elements~ and two
integers~ and~, Max k-Set Cover consists of finding a subfamily~ of cardinality at most~, covering at least~
elements of~. This problem is W[2]-hard when parameterized by~, and FPT
when parameterized by . We investigate the parameterized approximability of
the problem with respect to parameters~ and~. Then, we show that Max
Sat-k, a satisfiability problem generalizing Max k-Set Cover, is also FPT with
respect to parameter~.Comment: Accepted in RAIRO - Theoretical Informatics and Application