The class constrained bin packing problem with applications to video-on-demand

Authors:
E. C. Xavier;F. K. Miyazawa
Affiliations:
Instituto de Computação, Universidade Estadual de Campinas, Campinas, SP, Brazil;Instituto de Computação, Universidade Estadual de Campinas, Campinas, SP, Brazil
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 3
Cited 0

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Approximation algorithms for data placement on parallel disks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for online class-constrained packing

Theoretical Computer Science - Latin American theorotical informatics

Quantified Score

Hi-index	0.00

Visualization

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.