A note on the clustered set covering problem

DOI10.1016/J.DAM.2011.11.030zbMATH Open1331.90059OpenAlexW2068764930MaRDI QIDQ496643FDOQ496643

Jérôme Monnot, Laurent Alfandari

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)

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 (2)

• A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering
• Clustering heuristics for set covering

   Recommendations

• Approximation of the clustered set covering problem 👍 👎
• Clustering heuristics for set covering 👍 👎
• A new kind of cluster sets and their applications 👍 👎
• Title not available (Why is that?) 👍 👎
• Approximation Algorithms for the k-Clique Covering Problem 👍 👎
• A note on the generalized min-sum set cover problem 👍 👎
• Covering with clubs: complexity and approximability 👍 👎
• Title not available (Why is that?) 👍 👎
• On the clique cover width problem 👍 👎
• Vertex and edge covers with clustering properties: Complexity and algorithms 👍 👎

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)