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.
Bibliographical noteFunding Information:
This research was partially supported by the Hungarian National Foundation for Scientific Research, Grant F048587. E-mail addresses: email@example.com (L. Epstein), firstname.lastname@example.org (C. Imreh), email@example.com (A. Levin).
- Bin packing
- Online algorithms
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)