A note on the clustered set covering problem

DOI10.1016/j.dam.2011.11.030zbMath1331.90059OpenAlexW2068764930MaRDI QIDQ496643

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

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

Cites Work

• Unnamed Item
• The labeled perfect matching in bipartite graphs
• Optimization, approximation, and complexity classes
• Crew pairing at Air France
• Master-slave strategy and polynomial approximation
• The budgeted maximum coverage problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• Approximation algorithms and hardness results for labeled connectivity problems
• A threshold of ln n for approximating set cover
• A Greedy Heuristic for the Set-Covering Problem

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