
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover
We study the generalized min sum set cover (GMSSC) problem, wherein give...
read it

A General Framework for Approximating Min Sum Ordering Problems
We consider a large family of problems in which an ordering of a finite ...
read it

On Approximating (Sparse) Covering Integer Programs
We consider approximation algorithms for covering integer programs of th...
read it

Near Optimal Coflow Scheduling in Networks
The coflow scheduling problem has emerged as a popular abstraction in th...
read it

Theoretical and Practical Aspects of the Linear Tape Scheduling Problem
Magnetic tapes have been playing a key role as means for storage of digi...
read it

LPbased algorithms for multistage minimization problems
We consider a multistage framework introduced recently where, given a ti...
read it

Minimum Age TDMA Scheduling
We consider a transmission scheduling problem in which multiple systems ...
read it
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to MinSum Set Cover
We consider singlemachine scheduling problems that are natural generalizations or variations of the minsum set cover problem and the minsum vertex cover problem. For each of these problems, we give new approximation algorithms. Some of these algorithms rely on timeindexed LP relaxations. We show how a variant of alphapoint scheduling leads to the bestknown approximation ratios, including a guarantee of 4 for an interesting special case of the socalled generalized minsum set cover problem. We also make explicit the connection between the greedy algorithm for minsum set cover and the concept of Sidney decomposition for precedenceconstrained singlemachine scheduling, and show how this leads to a 4approximation algorithm for singlemachine scheduling with socalled bipartite ORprecedence constraints.
READ FULL TEXT
Comments
There are no comments yet.