The Class Constrained Bin Packing Problem with Applications to Video-on-Demand

  title={The Class Constrained Bin Packing Problem with Applications to Video-on-Demand},
  author={Eduardo C. Xavier and Fl{\'a}vio Keidi Miyazawa},
In this paper we present approximation results for the class con trained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are g iven bins of capacityB with C compartments, andn items ofQ different classes, each item i ∈ {1, . . . , n} with classci and sizesi. The problem is to pack the items into bins, where each bin contains at most C different classes and has total items size at most B. We present several approximation algorithms for offline and on line… CONTINUE READING
1 Extracted Citations
31 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 31 references

Variable s ized bin packing with color constraints

  • M. Dawande, J. Kalagnanam, J. Sethuranam
  • Proceedings of the 1th Brazilian Symposium on…
  • 2001
Highly Influential
9 Excerpts

and A

  • L. Golubchik, S. Khanna, S. Khuller, R. Thurimella
  • Zhu. Approximation algorithms for data placement…
  • 2000
Highly Influential
4 Excerpts

Storage: An Evaluation of New Applications

  • A. Chervenak.Tertiary
  • PhD thesis,
  • 1994
Highly Influential
10 Excerpts

Bin packing can be solv d within1 + ǫ in linear time.Combinatorica

  • W. Fernandez de la Vega, G. S. Lueker
  • 1981
Highly Influential
5 Excerpts

Approxi mat on algorithms for bin packing: a survey

  • E. G. Coffman, Jr., M. R. Garey, D. S. Johnson
  • PWS,
  • 1997
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…