Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.orl.2011.08.002 | Operations Research Letters |
Keywords | DocType | Volume |
Min-sum set cover,Approximation algorithms,α-point scheduling | Journal | 39 |
Issue | ISSN | Citations |
6 | 0167-6377 | 2 |
PageRank | References | Authors |
0.39 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Skutella | 1 | 1285 | 97.86 |
| David P. Williamson | 2 | 3564 | 413.34 |