加载中…
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 the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of for three bins. Additionally, we present a lower bound of $45/33 = 1.\overline{36}19/14$ for four and five bins that were discovered using a computer search.

生成讲解博客的中文版本

生成AI智能校验的中文版本