Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||The Class Constrained Bin Packing Problem With Applications To Video-on-demand|
|Abstract:||In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of capacity B with C compartments, and n items of Q different classes. The problem is to pack the items into the minimum number of bins, where each bin contains items of at most C different classes and has total items size at most B. We present several approximation algorithms for off-line and online versions of the problem. © Springer-Verlag Berlin Heidelberg 2006.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.