| Article ID: | iaor201111209 |
| Volume: | 39 |
| Issue: | 6 |
| Start Page Number: | 433 |
| End Page Number: | 436 |
| Publication Date: | Nov 2011 |
| Journal: | Operations Research Letters |
| Authors: | Skutella Martin, Williamson David P |
| Keywords: | covering problems, approximation algorithms |
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.