A note on the Clustered Set Covering Problem

Authors:
Laurent Alfandari;Jérôme Monnot
Affiliations:
ESSEC Business School, Av. B. Hirsch, 95021 Cergy Pontoise, France;CNRS, UMR 7243, F-75775 Paris, France and Université Paris-Dauphine, LAMSADE, F-75775 Paris, France
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 7
Cited 0

A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
The budgeted maximum coverage problem

Information Processing Letters
Master-Slave Strategy and Polynomial Approximation

Computational Optimization and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Applications of Operations Research in the Air Transport Industry

Transportation Science
The labeled perfect matching in bipartite graphs

Information Processing Letters
Local search for the minimum label spanning tree problem with bounded color classes

Operations Research Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

We define an NP-hard clustered variant of the Set Covering Problem 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/e-1)H(q), where q is the maximum number of elements covered by a cluster and H(q)=@?"i"="1^q1i.