Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

114

SOFSEM
2016
Springer

79views Theoretical Computer Science» more SOFSEM 2016»

Lower Bounds for Online Bin Stretching with Several Bins

10 years 15 days ago

Lower Bounds for Online Bin Stretching with Several Bins

Download ceur-ws.org

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 oﬄine 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

Martin Böhm

Real-time Traffic

SOFSEM 2016 | Theoretical Computer Science |

claim paper

Related Content

» OnLine BinStretching

» On Dynamic Bin Packing An Improved Lower Bound and Resource Augmentation Analysis

» Computing the asymptotic worstcase of bin packing lower bounds

» Online bin Packing with Two Item Sizes

» Bounds for online bounded space hypercube packing

» Online Bin Packing with Resource Augmentation

» On VariableSized Multidimensional Packing

» Online square and cube packing

» Class Constrained Bin Covering

» Routing and wavelength assignment in optical networks using bin packing based algorithms

Post Info
More Details (n/a)

Added	09 Apr 2016
Updated	09 Apr 2016
Type	Journal
Year	2016
Where	SOFSEM
Authors	Martin Böhm

Comments (0)