Polynomial time approximation schemes for class-constrained packing problems

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

Volumn 1913, Issue , 2000, Pages 238-249

  Shachnai, Hadas ^a   Tamir, Tami ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COLOR; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; MULTIMEDIA SYSTEMS; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING; STORAGE MANAGEMENT;

FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; LIMITED CAPACITY; MULTI PROCESSOR SCHEDULING; MULTIPLE KNAPSACK PROBLEM; OPTIMIZATION PROBLEMS; PACKING PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; PRODUCTION PLANNING;

POLYNOMIAL APPROXIMATION;

EID: 84937412190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44436-x_24     Document Type: Conference Paper

References (26)

1. A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operations Research. To appear.
2. A.K. Chandra, D.S. Hirschberg, and C.K. Wong. Approximate algorithms for some generalized knapsack problems. Theoretical Computer Science, 3:293–304, 1976.
3. C. Chekuri and S. Khanna. A PTAS for the multiple knapsack problem. SODA’00. pp. 213–222
4. E.G. Coffman, M.R. Garey, and D.S. Johnson. Approximation Algorithms for Bin Packing: A Survey. in Approximation Algorithms for NP-hard Problems. D.S. Hochbaum (Ed.). PWS Publishing Company, 1995.
5. M. Dawande, J. Kalagnanam, and J. Sethuraman. Variable sized bin packing with color-constraints. TR, IBM, T.J.Watson Research Center, Yorktown Heights, 1999.
6. L. Epstein and J. Sgall. Approximation schemes for scheduling on uniformlyre lated and identical parallel machines.ESA’99, LNCS 1643, pp. 151–162. Springer-Verlag.
7. C.E. Ferreira, A. Martin and, R. Weismantel. Solving multiple knapsack problems byc utting planes. SIAM J. on Opt., 6:858–877, 1996.
8. M.R. Gareyan d D.S. Johnson. Strong NP-completeness results: Motivations, examples, and implications. Journal of the ACM, 25:499–508, 1978.
9. G.V. Gens and E.V. Levner. Computational complexityof approximation algorithms for combinatorial problems. The 8th International Symp. on Mathematical Foundations of Computer Science, LNCS 74, pp. 292–300. Springer-Verlag, 1979.
10. L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, and A. Zhu. Approximation algorithms for data placement on parallel disks. SODA’00, pp. 223–232.
11. D.S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: Practical and theoretical results. Journal of the ACM, 34(1):144–162, 1987.
12. M.S. Hung and J.C. Fisk. A heuristic routine for solving large loading problems. Naval Research Logistical Quarterly, 26(4):643–50, 1979.
13. T. Ibaraki and N. Katoh. Resource Allocation Problems - Algorithmic Approaches. The MIT Press, 1988.
14. O.H. Ibarra and C.E. Kim. Fast approximation for the knapsack and the sum of subset problems. Journal of the ACM, 22(4):463–468, 1975.
15. G. Ingargiola and J. F. Korsh. An algorithm for the solution of 0-1 loading problems. Operations Research, 23(6):110–119, 1975.
16. N. Karmakar and R.M. Karp. An efficient approximation scheme for the onedimensional bin packing problem. FOCS’82, pp. 312–320.
17. H. Kellerer. A polynomial time approximation scheme for the multiple knapsack problem. APPROX’99, LNCS 1671, pp. 51–62. Springer-Verlag.
18. E. Y-H Lin. A bibliographical surveyon some well-known non-standard knapsack problems. Information Systems and Oper. Research, 36:4, pp. 274–317, 1998.
19. S. Martello and P. Toth. Algorithms for knapsack problems. Annals of Discrete Math., 31:213–258, 1987.
20. R. Motwani. Lecture notes on approximation algorithms. Technical report, Dept. of Computer Science, Stanford Univ., CA, 1992.
21. H. Shachnai and T. Tamir. On two class-constrained versions of the multiple knapsack problem. Algorithmica. To appear.
22. H. Shachnai and T. Tamir. Scheduling with limited number of machine allotments and limited parallelism. Manuscript, 2000.
23. H. Shachnai and T. Tamir. Polynomial time approximation schemes for classconstrained packing problems (full version). http://www.cs.technion.ac.il/~hadas.
24. J. Turek, J. Wolf, and P. Yu. Approximate algorithms for scheduling parallelizable tasks. SPAA’92, pp. 323–332.
25. W.F. Vega and G.S. Leuker. Bin packing can be solved within 1+ε in linear time. Combinatorica, 1:349–355, 1981.
26. J.L. Wolf, P.S. Yu, and H. Shachnai. Disk load balancing for video-on-demand systems. ACM Multimedia Systems Journal, 5:358–370, 1997.