| Autor: |
Alsarhan, Hamza, Chia, Davin, Christman, Ananya, Fu, Shannia, Jin, Tony |
| Rok vydání: |
2015 |
| Předmět: |
|
| Druh dokumentu: |
Working Paper |
| Popis: |
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. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
