Improved Approximation Algorithms for Resource Allocation
We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2 - ε)-approximated in polynomial time, which improves upon earlier approximation results for this problem, the best previously published result being a 1/4-approximation. We also give a simpler and faster 1/3-approximation algorithm.
KeywordsInterval Graph Optimal Packing Call Admission Control Large Task Improve Approximation Algorithm
Unable to display preview. Download preview PDF.
- 2.A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, B. Schieber. A unified approach to approximating resource allocation and scheduling. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (2000), 735–744.Google Scholar
- 3.A. Bar-Noy. Private communication (2001).Google Scholar
- 4.B. Chen, R. Hassin, M. Tzur. Allocation of bandwidth and storage. IIE Transactions, 34 (2002), 501–507.Google Scholar
- 6.S. Leonardi, A. Marchetti-Spaccamela, A. Vitaletti. Approximation algorithms for bandwidth and storage allocation problems under real time constraints. In Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science (2000), 409–420.Google Scholar
- 8.C. Phillips, R N. Uma, J. Wein. Off-line admission control for general scheduling problems. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (2000), 879–888.Google Scholar