arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.10322cs.DS
收藏

带建议的在线二维的向量装箱

Online Two-Dimensional Vector Packing with Advice

Bengt J. Nilsson, Gordana Vujovic

摘要:

我们考虑在线二维的【形】向量装箱问题,给出了该问题的任意{ \sc AnyFit}策略的竞争比的$11/5$下界.对于所有输入向量被限制为具有$[π/4-γ/2,π/4+γ/2]$范围内的角度的任何实例,对于$0\leqγ<π/3$和$\max\left\{5/2,4\big/\big(1+2\tan(π/4-γ/2)\big)+ε\right\}$,我们提供具有竞争比$\max\!\left\{2,6\big/\big(1+3\tan(π/4-γ/2)\big)+ε\right\}$和对数建议的策略;对于所有输入向量被限制为具有$[π/4-γ/2,π/4+γ/2]$范围内的角度的任何实例,对于$0\leqγ\leqπ/3$,我们提供对数建议的策略。此外,我们给出了一个$5/2$ -竞争策略,也使用对数的建议,为无限制向量的情况下。这些结果应与当前最佳竞争策略FirstFit进行对比,FirstFit具有竞争比~ $27/10$。

英文摘要:

We consider the online two-dimensional vector packing problem, showing a lower bound of $11/5$ on the competitive ratio of any {\sc AnyFit} strategy for the problem. We provide strategies with competitive ratio $\max\!\left\{2,6\big/\big(1+3\tan(π/4-γ/2)\big)+ε\right\}$ and logarithmic advice, for any instance where all the input vectors are restricted to have angles in the range $[π/4-γ/2,π/4+γ/2]$, for $0\leqγ<π/3$ and $\max\left\{5/2,4\big/\big(1+2\tan(π/4-γ/2)\big)+ε\right\}$ and logarithmic advice, for any instance where all the input vectors are restricted to have angles in the range $[π/4-γ/2,π/4+γ/2]$, for $0\leqγ\leqπ/3$. In addition, we give a $5/2$-competitive strategy also using logarithmic advice for the unrestricted vectors case. These results should be contrasted to the currently best competitive strategy, FirstFit, having competitive ratio~$27/10$.

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

↑