A note on the generalized min‐sum set cover problem

A note on the generalized min‐sum set cover problem

0.00 Avg rating0 Votes
Article ID: iaor201111209
Volume: 39
Issue: 6
Start Page Number: 433
End Page Number: 436
Publication Date: Nov 2011
Journal: Operations Research Letters
Authors: ,
Keywords: covering problems, approximation algorithms
Abstract:

This paper considers the generalized min-sum set cover problem. A 485-approximation algorithm was previously known. We improve this to a 28-approximation algorithm.

Reviews

Required fields are marked *. Your email address will not be published.