## Class Constrained Bin Covering

- Leah Epstein, Csanád Imreh, Asaf Levin
- Theory of Computing Systems
- 2008

@inproceedings{Xavier2006TheCC, title={The Class Constrained Bin Packing Problem with Applications to Video-on-Demand}, author={Eduardo C. Xavier and Fl{\'a}vio Keidi Miyazawa}, booktitle={COCOON}, year={2006} }

- Published 2006 in COCOON
DOI:10.1007/11809678_46

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