
The paper presents a new dependent rounding algorithm for bipartite graphs that achieves strong negative correlation properties. This algorithm is then used to obtain an improved approximation algorithm for the problem of scheduling on unrelated machines to minimize weighted completion time.


coremsg

dependent-rounding-with-strong-negative-correlation-for-scheduling-on-unrelated-machines-to-minimize-weighted-completion-time


Dependent Rounding with Strong Negative Correlation for Scheduling on Unrelated Machines to Minimize Weighted Completion Time
