50 citations · 64 across the 7 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 6 cited
Improved Lower Bounds for Online Hypercube and Rectangle Packing
David Blitz, Sandy Heydrich, Rob van Stee +2
Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more…
cs.DS2016
A Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5
Martin Böhm, Jiří Sgall, Rob van Stee +1
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack t…