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, Caixa Postal 6176, 13084971, Campinas, SP, Brazil;Instituto de Computação, Universidade Estadual de Campinas, Caixa Postal 6176, 13084971, Campinas, SP, Brazil

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

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 size B with C compartments, and n items of Q different classes, each item i@?{1,...,n} with class c"i and size s"i. 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 online versions of the problem.