A note on the Clustered Set Covering Problem

Laurent Alfandari (1) , Jérôme Monnot (2)

1 ESSEC Business School
2 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

We define an NP-hard clustered variant of the SetCoveringProblem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. We show that the problem is approximable within ratio (1+ϵ)(e/e−1)H(q), where q is the maximum number of elements covered by a cluster and View the MathML source.

Mots clés: Setcovering; Maximal coverage; Approximation; Integer programming

Domaines: Informatique [cs]

Laurent Alfandari, Jérôme Monnot. A note on the Clustered Set Covering Problem. Discrete Applied Mathematics, 2014, 164, Part 1, pp.13-19. ⟨10.1016/j.dam.2011.11.030⟩. ⟨hal-01508784⟩