A note on the generalized min-sum set cover problem
Data Structures and Algorithms
2011-07-12 v1
Abstract
In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin. Bansal, Gupta, and Krishnaswamy 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.
Cite
@article{arxiv.1107.2033,
title = {A note on the generalized min-sum set cover problem},
author = {Martin Skutella and David P. Williamson},
journal= {arXiv preprint arXiv:1107.2033},
year = {2011}
}