Lower Bounds for Online Bin Stretching with Several Bins

Online Bin Stretching is a semi-online variant of Bin Packing with a set number of m bins, where all bins can be overpacked to capacity S ≥ 1, which is to be minimized. There is also a guarantee that an offline algorithm can pack the input to m bins of unit size. We focus on the problem of Online Bin Stretching for small m, namely 3 ≤ m ≤ 5. Recent progress on this problem has led into a lower

• Type: Journal
• Year: 2016
• Where: SOFSEM
• Authors: Martin Böhm
• Keywords: SOFSEM 2016, Theoretical Computer Science