Class constrained bin packing revisited

Authors:
Leah Epstein;Csanád Imreh;Asaf Levin
Affiliations:
Department of Mathematics, University of Haifa, 31905 Haifa, Israel;Department of Informatics, University of Szeged, 6720 Szeged, Hungary;Chaya fellow. Faculty of Industrial Engineering and Management, The Technion, 32000 Haifa, Israel
Venue:
Theoretical Computer Science
Year:
2010

Citing 11
Cited 1

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
On-line bin packing in linear time

Journal of Algorithms
An improved lower bound for on-line bin packing algorithms

Information Processing Letters
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems

Journal of the ACM (JACM)
Errata: `` Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems''

Journal of the ACM (JACM)
On the online bin packing problem

Journal of the ACM (JACM)
Tight bounds for online class-constrained packing

Theoretical Computer Science - Latin American theorotical informatics
Algorithms for on-line bin-packing problems with cardinality constraints

Discrete Applied Mathematics
Online Bin Packing with Cardinality Constraints

SIAM Journal on Discrete Mathematics
The class constrained bin packing problem with applications to video-on-demand

Theoretical Computer Science
An efficient approximation scheme for the one-dimensional bin-packing problem

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

An improved approximation scheme for variable-sized bin packing

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.