Approximation of the clustered set covering problem
type: Item
instance of: scholarly article
zbMATH Open document ID: 1237.90163
author: Jérôme Monnot
author: Laurent Alfandari
published in: Electronic Notes in Discrete Mathematics
publication date: 2012-05-13T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6033959
zbMATH Keywords: integer programming
zbMATH Keywords: set covering
zbMATH Keywords: maximal coverage
zbMATH Keywords: NP-hardness
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: j.endm.2010.05.061
OpenAlex ID: W2077251193
cites work: Master-slave strategy and polynomial approximation
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
cites work: Crew pairing at Air France
cites work: A threshold of ln n for approximating set cover
cites work: Q4198056
cites work: The budgeted maximum coverage problem
cites work: Optimization, approximation, and complexity classes
DOI: 10.1016/J.ENDM.2010.05.061
title: Approximation of the clustered set covering problem
description: scientific article; zbMATH DE number 6033959