Improved approximation algorithms for resource allocation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2337 LNCS, Issue , 2002, Pages 401-414

  Calinescu, Gruia ^a   Chakrabarti, Amit ^b   Karloff, Howard ^c   Rabani, Yuval ^d  

^a Illinois Institute of Technology   (United States)

^b Princeton University   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROFITABILITY; RESOURCE ALLOCATION; ALGORITHMS; INTEGER PROGRAMMING; OPTIMIZATION;

APPROXIMATION RESULTS; FINISH TIME; NP-HARD; POLYNOMIAL-TIME; RESOURCE ALLOCATION PROBLEM; RESOURCE REQUIREMENTS;

INTEGER PROGRAMMING; APPROXIMATION ALGORITHMS;

EID: 84868632657     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47867-1_28     Document Type: Conference Paper

References (8)

1. E. M. Arkin, E. B. Silverberg. Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18 (1987), 1-8.
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.
3. A. Bar-Noy. Private communication (2001).
4. B. Chen, R. Hassin, M. Tzur. Allocation of bandwidth and storage. IIE Transactions, 34 (2002), 501-507.
5. N. G. Hall, M. J. Magazine. Maximizing the value of a space mission. European Journal of Operational Research, 78 (1994), 224-241.
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.
7. J. B. Orlin. A faster strongly polynomial minimum cost flow algorithm. Operations Research, 41 (1993), 338-350.
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.