An efficient approximation for the Generalized Assignment Problem

Information Processing Letters

Volumn 100, Issue 4, 2006, Pages 162-166

  Cohen, Reuven ^a   Katzir, Liran ^a   Raz, Danny ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; Generalized Assignment Problem; Local ratio

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; NUMBER THEORY; PROBLEM SOLVING; TRANSLATION (LANGUAGES);

APPROXIMATION ALGORITHMS; APPROXIMATION RATIO; GENERALIZED ASSIGNMENT PROBLEM (GAP); LOCAL RATIO;

APPROXIMATION THEORY;

EID: 33747361765     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.06.003     Document Type: Article

References (14)

1. Bafna V., Berman P., and Fujito T. A 2-approximation algorithm for the undirected feedback vertex set problem. SIJDM: SIAM Journal on Discrete Mathematics 12 (1999) 289-297
2. Baptiste P. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling 2 (1999) 245-252
3. Bar-Noy A., Bar-Yehuda R., Freund A., Naor J.S., and Schieber B. A unified approach to approximating resource allocation and scheduling. Journal of the ACM 48 5 (2001) 1069-1090
4. Bar-Yehuda R., and Even S. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25 (1985) 27-45
5. Bar-Yehuda R., Halldórsson M.M., Naor J.S., Shachnai H., and Shapira I. Scheduling split intervals. SODA'02: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2002), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA 732-741
6. Brucker P. Scheduling Algorithms (1998), Springer, Berlin
7. Chekuri C., and Khanna S. A PTAS for the multiple knapsack problem. SODA'00: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (2000), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA 213-222
8. Dawande M., Kalagnanam J., Keskinocak P., Salman F.S., and Ravi R. Approximation algorithms for the multiple knapsack problem with assignment restrictions. Journal of Combinatorial Optimization 4 2 (2000) 171-186
9. L. Fleischer, M.X. Goemans, V.S. Mirrokni, M. Sviridenko, Tight approximation algorithms for maximum general assignment problems, in: SODA'06: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 611-620
10. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer, Berlin
11. Lawler E.L. Fast approximation algorithms for knapsack problems. Mathematics of Operations Research 4 4 (1979) 339-356
12. Nutov Z., Beniaminy I., and Yuster R. A (1 - 1 / e)-approximation algorithm for the generalized assignment problem. Operations Research Letters 34 3 (2006) 283-288
13. Shmoys D.B., and Tardos E. An approximation algorithm for the generalized assignment problem. Mathematical Programming 62 3 (1993) 461-474
14. F.C. Spieksma, J. Aerts, J. Korst, An approximation algorithm for a generalized assignment problem with small resource requirements, in: ORBEL: 18th Belgian Conference on Quantitative Methods for Decision Making, 2004