A note on the clustered set covering problem
From MaRDI portal
Publication:496643
DOI10.1016/J.DAM.2011.11.030zbMATH Open1331.90059OpenAlexW2068764930MaRDI QIDQ496643FDOQ496643
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
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
- A threshold of ln n for approximating set cover
- Title not available (Why is that?)
- A Greedy Heuristic for the Set-Covering Problem
- Optimization, approximation, and complexity classes
- Crew pairing at Air France
- The labeled perfect matching in bipartite graphs
- The budgeted maximum coverage problem
- Approximation algorithms and hardness results for labeled connectivity problems
- Local search for the minimum label spanning tree problem with bounded color classes.
- Master-slave strategy and polynomial approximation
Cited In (4)
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)
