A note on the generalized min-sum set cover problem

In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin (STOC 2009). Bansal, Gupta, and Krishnaswamy (SODA 2010) give a 485-approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-approximation algorithm, improving the performance guarantee by an order of magnitude. We use concepts from αα-point scheduling to obtain our improvements.

► 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.