Approximation of the Clustered Set Covering Problem

DOI10.1016/j.endm.2010.05.061zbMath1237.90163OpenAlexW2077251193MaRDI QIDQ2883599

Jérôme Monnot, Laurent Alfandari

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.061

zbMATH Keywords

integer programmingapproximationset coveringNP-hardnessmaximal coverage

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Optimization, approximation, and complexity classes
• Crew pairing at Air France
• Master-slave strategy and polynomial approximation
• The budgeted maximum coverage problem
• A threshold of ln n for approximating set cover
• A Greedy Heuristic for the Set-Covering Problem
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling

This page was built for publication: Approximation of the Clustered Set Covering Problem