A new approximation technique for resource-allocation problems

作者：Saha Barna; Srinivasan Aravind

来源：Random Structures and Algorithms, 2018, 52(4): 680-715.

DOI：10.1002/rsa.20756

• approximation algorithms
• integrality gap
• randomized algorithms
• rounding
• Scheduling

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.

• 出版日期2018-7