Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Theoretical Informatics and Applications Année : 2016

Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems

Résumé

Given a family of subsets S over a set of elements X and two integers p and k, max k-set cover consists of finding a subfamily T ⊆ S of cardinality at most k, covering at least p elements of X. This problem is W[2]-hard when parameterized by k, and FPT when parameterized by p. We investigate the parameterized approximability of the problem with respect to parameters k and p. Then, we show that max sat-k, a satisfiability problem generalizing max k-set cover, is also FPT with respect to parameter p.

Dates et versions

hal-01505479 , version 1 (11-04-2017)

Identifiants

Citer

Edouard Bonnet, Vangelis Paschos, Florian Sikora. Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems. RAIRO - Theoretical Informatics and Applications, 2016, 50 (3), ⟨10.1051/ita/2016022⟩. ⟨hal-01505479⟩
134 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More