Class constrained bin packing revisited

Leah Epstein, Csand Imreh, Asaf Levin

Research output: Contribution to journalArticlepeer-review


We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the total number of colors of the items in S is at most k (which distinguishes our problem from the classical version). We follow earlier work on this problem and study the problem in both offline and online scenarios.

Original languageEnglish
Pages (from-to)3073-3089
Number of pages17
JournalTheoretical Computer Science
Issue number34-36
StatePublished - 17 Jul 2010

Bibliographical note

Funding Information:
This research was partially supported by the Hungarian National Foundation for Scientific Research, Grant F048587. E-mail addresses: [email protected] (L. Epstein), [email protected] (C. Imreh), [email protected] (A. Levin).


  • Bin packing
  • Online algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Class constrained bin packing revisited'. Together they form a unique fingerprint.

Cite this