arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.08111cs.DS
收藏

拉伸因子为1.5的面元拉伸两阶段算法

A Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5

Martin Böhm, Jiří Sgall, Rob van Stee, Pavel Veselý

摘要:

在线箱拉伸是箱包装的半在线变体,其中算法必须使用与最佳包装相同数量的箱,但允许稍微过度包装箱。目标是最小化过度包装的量,即,最大尺寸装入任何箱子。我们给出了一个算法的在线箱拉伸与拉伸因子为1.5的任何数量的箱。我们建立在以前的算法,并使用两个阶段的方法。然而,我们的分析在技术上更复杂,并在两个权重函数的帮助下使用了摊销。

英文摘要:

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 1.5 for any number of bins. We build on previous algorithms and use a two-phase approach. However, our analysis is technically more complicated and uses amortization over the bins with the help of two weight functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑