On two class-constrained versions of the multiple knapsack problem

Algorithmica (New York)

Volumn 29, Issue 3, 2001, Pages 442-467

  Shachnai, H ^a   Tamir, T ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; Fairness; Knapsack; Multimedia on demand; Packing; Resource allocation; Utilization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; RESOURCE ALLOCATION;

APPROXIMATION ALGORITHMS;

MULTIMEDIA SYSTEMS;

EID: 0141982763     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010057     Document Type: Article

References (22)

1. C. Aggarwal, J. Wolf, and P. S. Yu, On optimal piggyback merging policies for video-on-demand systems, in Proceedings of Sigmetrics, 1996, pp. 200-209.
2. S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju, Staggered striping in multimedia information systems, in Proceedings of SIGMOD. 1994, pp. 79-90.
3. A.K. Chandra, D.S. Hirschberg and C.K. Wong, Approximate algorithms for some generalized knapsack problems, Theoret. Comput. Sci., 3 (1976), 293-304.
4. P. Chen, E. Lee, G. Gibson, R. Katz, and D. Patterson, RAID: high performance, reliable secondary storage, ACM Comput. Surveys, 26(2) (1994), 145-185.
5. T. Corman, C. Leiserson, and R. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, MA, 1990.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
7. G.V. Gens and E.V. Levner, Computational complexity of approximation algorithms for combinatorial problems, in Proceedings of the 8th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 74, Springer-Verlag, Berlin, 1979, pp. 292-300.
8. L. Golubchik, J.C.S Lui, and R.R. Muntz, Adaptive piggybacking: a novel technique for data sharing in video-on-demand storage servers, ACM Multimedia Systems J., 4(3) (1996), 140-155.
9. R.L. Graham, Bounds for certain multiprocessing anomalies, Bell Systems Tech. J., 45 (1966), 1563-1581.
10. R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), 263-269.
11. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math., 5 (1979), 287-326.
12. D.S. Hochbaum, Approximation Algorithms for NP-Hard Problems, PWS, Boston, MA, 1995.
13. D.S. Hochbaum and D.B. Shmoys, Using dual approximation algorithms for scheduling problems: practical and theoretical results, J. Assoc. Comput. Mach., 34(1) (1987), 144-162.
14. T. Ibaraki and N. Katoh, Resource Allocation Problems - Algorithmic Approaches, The MIT Press, Cambridge, MA, 1988.
15. O.H. Ibarra and C.E. Kim, Fast approximation for the knapsack and the sum of subset problems, J. Assoc. Comput. Mach., 22 (1979), 463-488.
16. M. Kamath, K. Ramamritham, and D. Towsley, Continuous media sharing in multimedia database systems, in Proceedings of the Fourth International Conference on Database Systems for Advanced Applications, Singapore, 1995, pp. 79-86.
17. P.W.K. Lie, J.C.S. Lui, and L. Golubchik, Threshold-based dynamic replication in large-scale video-on-demand systems, in Proceedings of the Eighth International Workshop on Research Issues in Database Engineering (RIDE), Orlando, FL, February 1998, pp. 52-59.
18. S. Martello and P. Toth, Algorithms for knapsack problems, Ann. Discrete Math., 31 (1987), 213-258.
19. D. Pisinger, Algorithms for Knapsack Problems, Ph.D. Thesis, Department of Computer Science, University of Copenhagen, February 1995.
20. S.S. Skiena, The Algorithm Design Manual, Springer-Verlag, New York, 1998.
21. J.L. Wolf, P.S. Yu, and H. Shachnai, Scheduling issues in video-on-demand systems, in Multimedia Information Storage and Management (Soon M. Chung, ed.), Kluwer, Dordrecht, 1996, pp. 183-207.
22. J.L. Wolf, P.S. Yu, and H. Shachnai, Disk load balancing for video-on-demand systems, ACM Multimedia Systems J., 5 (1997), 358-370.