A note on the generalized min-sum set cover problem

作者：Skutella Martin; Williamson David P^*

来源：Operations Research Letters, 2011, 39(6): 433-436.

DOI：10.1016/j.orl.2011.08.002

• Min-sum set cover
• Approximation algorithms
• alpha-point scheduling

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-app oximation 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 alpha-point scheduling to obtain our improvements.

• 出版日期2011-11