A new approximation technique for resource-allocation problems

被引：9
|
作者：
Saha, Barna [1 ]
Srinivasan, Aravind [2 ,3 ]
机构：
[1] Univ Massachusetts, Amherst, MA 01002 USA
[2] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
[3] Univ Maryland, Inst Adv Comp Studies, College Pk, MD 20742 USA
来源：
RANDOM STRUCTURES & ALGORITHMS | 2018年 / 52卷 / 04期
关键词：
approximation algorithms; integrality gap; randomized algorithms; rounding; Scheduling; HARD CAPACITIES; ASSIGNMENT PROBLEM; INDIVISIBLE GOODS; PARALLEL MACHINES; ALGORITHM; CONSTRAINTS;
D O I：
10.1002/rsa.20756
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We develop a rounding method based on random walks in polytopes, which leads to improved approximation algorithms and integrality gaps for several assignment problems that arise in resource allocation and scheduling. In particular, it generalizes the work of Shmoys and Tardos on the generalized assignment problem to the setting where some jobs can be dropped. New concentration bounds for random bipartite matching are developed as well.
引用
收藏
页码：680 / 715
页数：36
相关论文
共 50 条
12345