Online Bin Packing with Frequency Predictions and Competitive Analysis

The authors design and analyze online algorithms for the bin packing problem that leverage frequency predictions about the item sizes in the input sequence. The algorithms aim to achieve a good tradeoff between consistency (competitive ratio with perfect predictions) and robustness (competitive ratio under adversarial prediction error).