A (1-1/e)-approximation algorithm for the generalized assignment problem

Operations Research Letters

Volumn 34, Issue 3, 2006, Pages 283-288

  Nutov, Zeev ^a   Beniaminy, Israel ^b   Yuster, Raphael ^c  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b ClickSoftware Technologies   (Israel)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

Approximation algorithm; Generalized assignment

Indexed keywords

APPROXIMATION THEORY; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; GENERALIZED ASSIGNMENT;

ALGORITHMS;

EID: 32644445035     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.05.006     Document Type: Article

References (9)

1. J. Aerts, J. Korst, and F. Spieksma Approximation of a retrieval problem for parallel disks Lect. Notes in Comput. Sci. 2653 2003 178 188
2. J. Aerts, J. Korst, F. Spieksma, W. Verhaegh, and G. Woeginger Random redundant storage in disk arrays: complexity of retrieval problems IEEE Trans. Comput. 52 9 2003 1210 1214
3. N. Alon, and J.H. Spencer The Probabilistic Method second ed. 2000 Wiley New York
4. C. Chekuri, S. Khanna, A PTAS for the multiple Knapsack problem, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2000, pp. 213-222.
5. M. Dawande, J. Kalagnanam, The multiple Knapsack problem with color constraints, IBM Research Report RC 21128 (94508) 1998.
6. M. Dawande, J. Kalagnanam, P. Keskinocak, R. Ravi, and F.S. Salman Approximation algorithms for the multiple Knapsack problem with assignment restrictions J. Combin. Optim. 4 2000 171 186
7. M. Grötschel, L. Lovász, and A. Schrijver Geometric Algorithms and Combinatorial Optimization 1998 Springer New York
8. V. Kann Maximum bounded three-dimensional matching is MAX-SNP-complete Inform. Process. Lett. 37 1991 27 35
9. D.B. Shmoys, and E. Tardos An approximation algorithm for the generalized assignment problem Math. Programming A 62 1993 461 474