A New Approximation Technique for Resource-Allocation Problems
Data Structures and Algorithms
2017-12-19 v2 Distributed, Parallel, and Cluster Computing
Abstract
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.
Cite
@article{arxiv.1001.1470,
title = {A New Approximation Technique for Resource-Allocation Problems},
author = {Barna Saha and Aravind Srinivasan},
journal= {arXiv preprint arXiv:1001.1470},
year = {2017}
}
Comments
Journal version in Random Structures & Algorithms, Conference version in Proceedings of Innovations in Computer Science (ICS) 2010