Polynomial time approximation schemes for class-constrained packing problems

Journal of Scheduling

Volumn 4, Issue 6, 2001, Pages 313-338

  Shachnai, Hadas ^a   Tamir, Tami ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms; Bin packing; Class constraints; Multiple knapsack; Polynomial time approximation schemes

Indexed keywords

EID: 0347122294     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.86     Document Type: Article

References (35)

1. Wolf JL, Yu PS, Shachnai H. Disk load balancing for video-'on-demand systems. ACM Multimedia Systems Journal 1997; 5:358-370.
2. Ghandeharizadeh S, Muntz RR. Design and implementation of scalable continuous media servers. Parallel Computing Journal 1998; 24(1):91-122.
3. Ibaraki T, Katoh N. Resource Allocation Problems - Algorithmic Approaches. The MIT Press: Cambridge, MA, 1988.
4. Turek J, Wolf JL, Yu PS. Approximate algorithms for scheduling parallelizable tasks. Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures, San Diego, CA, June 1992; 323-332.
5. Shachnai H, Turek J. Multiresource malleable task scheduling. Information Processing Letters 1999; 70:47-52.
6. Ingargiola G, Korsh JF. An algorithm for the solution of 0-1 loading problems. Operations Research 1975; 23(6):110-119.
7. Chandra AK, Hirschberg DS, Wong CK. Approximate algorithms for some generalized knapsack problems. Theoretical Computer Science 1976; 3:293-304.
8. Fisk JC, Hung MS. A heuristic routine for solving large loading problems. Naval Research Logistical Quarterly 1979; 26(4):643-650.
9. Ferreira CE, Martin A, Weismantel R. Solving multiple knapsack problems by cutting planes. SIAM Journal on Optics 1996; 6:858-877.
10. Chekuri C, Khanna S. A PTAS for the multiple knapsack problem. Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000; 213-222.
11. Martello S, Toth P. Algorithms for knapsack problems. Annals of Discrete Mathematics 1987; 31:213-258.
12. Coffman EG, Garey MR, Johnson DS. Approximation algorithms for bin packing: a survey. In Approximation Algorithms for NP-hard Problems, Hochbaum DS (ed.). PWS Publishing Company, 1995.
13. Lin EY-H. A bibliographical survey on some well-known non-standard knapsack problems. Information Systems and Operations Research 1998; 36(4):274-317.
14. Ibarra OH, Kim CE. Fast approximation for the knapsack and the sum of subset problems. Journal of the ACM 1975; 22(4):463-468.
15. Gens GV, Levner EV. Computational complexity of approximation algorithms for combinatorial problems. Proceedings of the 8th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 74. Springer: Berlin, 1979; 292-300.
16. Garey MR, Johnson DS. Strong NP-completeness results: Motivations, examples, and implications. Journal of the ACM 1978; 25:499-508.
17. Kellerer H. A polynomial time approximation scheme for the multiple knapsack problem. Proceedings of APPROX'99, Lecture Notes in Computer Science. Springer: Verlag, Berlin, 1999; 51-62.
18. Motwani R. Lecture notes on approximation algorithms. Technical Report, Department of Computer Science, Stanford University, CA, 1992.
19. Vega WF, Leukcr GS. Bin packing can be solved within 1 + ε in linear time. Combinatorica 1981; 1:349-355.
20. Hochbaum DS, Shmoys DB. Using dual approximation algorithms for scheduling problems: practical and theoretical results. Journal of the ACM 1987; 34(1):144-162.
21. Epstein L, Sgall J. Approximation schemes for scheduling on uniformly related and identical parallel machines. Proceedings of the 7th European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 1643. Springer: Berlin, 1999; 151-162.
22. Frieze AM, Clarke MRB. Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses. European Journal of Operational Research 1984; 15:100-109.
23. Chekuri C, Khanna S. On multi-dimensional packing problems. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999; 185-194.
24. Krause KL, Shen VY, Schwetman HD. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM 1975; 22(4):522-550.
25. Kellerer H, Pferschy U. Cardinality constrained bin-packing problems. Annals of Operations Research 1999; 92:335-348.
26. Caprara A, Kellerer H, Pferschy U, Pisinger D. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operations Research 2000; 123:333-345.
27. Shachnai H, Tamir T. On two class-constrained versions of the multiple knapsack problem. Algorithmica 2001; 29(3):442-467.
28. Golubchik L, Khanna S, Khuller S, Thurimella R, Zhu A. Approximation algorithms for data placement on parallel disks. Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000; 223-232.
29. Shachnai H, Tamir T. Multiprocessor scheduling with machine allotment and parallelism constraints. Algorithmica, to appear.
30. Karmakar N, Karp RM. An efficient approximation scheme for the one-dimensional bin packing problem. Proceedings of the 23rd Symposium on Foundations of Computer Science, 1982; 312-320.
31. Dawande M, Kalagnanam J, Sethuraman J. Variable sized bin packing with colour-constraints. Technical Report, IBM, T.J. Watson Research Center, NY, 1998.
32. Alon N, Azar Y, Woeginger GJ, Yadid T. Approximation schemes for scheduling. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997; 493-500.
33. Shmoys DB, Tardos E. An approximation algorithm for the generalized assignment problem. Mathematical Programming A 1993; 62:461-474.
34. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, NY, 1979.
35. Kann V. Maximum bounded 3-dimensional matching is max SNP-complete. Information Processing Letters 1991; 37:27-35.