Colored Bin Packing
Data Structures and Algorithms
2015-09-01 v1
Abstract
We study the Colored Bin Packing Problem: we are given a set of items where each item has a weight and color. We must pack the items in bins of uniform capacity such that no two items of the same color may be adjacent within in a bin. The goal is to perform this packing using the fewest number of bins. We consider a version of the problem where reordering is allowed. We first consider the zero-weight and unit weight versions of this problem, i.e. where the items have weight zero and one, respectively. We present linear time optimal algorithms for both versions.
Keywords
Cite
@article{arxiv.1508.07380,
title = {Colored Bin Packing},
author = {Hamza Alsarhan and Davin Chia and Ananya Christman and Shannia Fu and Tony Jin},
journal= {arXiv preprint arXiv:1508.07380},
year = {2015}
}