A note on the clustered set covering problem

DOI10.1016/J.DAM.2011.11.030MaRDI QIDQ496643zbMATHOpenAlexFDO

Authors Laurent Alfandari, Jérôme Monnot

Publication date 22 September 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.11.030

zbMATH Keywords

integer programmingapproximationset coveringmaximal coverage

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Approximation of the clustered set covering problem
• Clustering heuristics for set covering
• A new kind of cluster sets and their applications
• scientific article; zbMATH DE number 7662168
• Approximation Algorithms for the k-Clique Covering Problem
• A note on the generalized min-sum set cover problem
• Covering with clubs: complexity and approximability
• scientific article; zbMATH DE number 883430
• On the clique cover width problem
• Vertex and edge covers with clustering properties: Complexity and algorithms

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• A threshold of ln n for approximating set cover
• Approximation algorithms and hardness results for labeled connectivity problems
• Crew pairing at Air France
• Local search for the minimum label spanning tree problem with bounded color classes.
• Master-slave strategy and polynomial approximation
• Optimization, approximation, and complexity classes
• The budgeted maximum coverage problem
• The labeled perfect matching in bipartite graphs

Cited in

(4)

• A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering
• Clustering heuristics for set covering
• Approximation of the clustered set covering problem
• A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification

This page was built for publication: A note on the clustered set covering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496643)