Approximating Min-sum Set Cover

  • Uriel Feige ,
  • Laszlo Lovasz ,
  • Prasad Tetali

MSR-TR-2003-21 |

Note: A preliminary version of this paper appeared in the conference proceedings of APPROX 2002.

Download BibTex

The min sum set cover (mssc ) problem is a problem related both to the classical min set cover problem, and to the linear arrangement problems.