A note on the generalized min-sum set cover problem

Details A note on the generalized min-sum set cover problem A note on the generalized min-sum set cover problem

2011-07-11

arxiv.org/abs/1107.2033v1

Computer Science

Data Structures and Algorithms

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

A note on the generalized min-sum set cover problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on the generalized min-sum set cover problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on the generalized min-sum set cover problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137925