当前位置: X-MOL 学术Algorithmica › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Efficient 1-Space Bounded Hypercube Packing Algorithm
Algorithmica ( IF 0.9 ) Pub Date : 2020-06-05 , DOI: 10.1007/s00453-020-00723-5
Paulina Grzegorek , Janusz Januszewski , Łukasz Zielonka

A space bounded $$ O(d/\log d)$$ O ( d / log d ) -competitive hypercube packing algorithm with one active bin only is presented. As a starting point we give a simple 1-space bounded hypercube packing algorithm with competitive ratio $$ (3/2)^{d}+O((21/16)^d)$$ ( 3 / 2 ) d + O ( ( 21 / 16 ) d ) , for $$d\ge 3.$$ d ≥ 3 .

中文翻译:

高效的 1 空间有界超立方体包装算法

提出了一种空间有界 $$ O(d/\log d)$$ O ( d / log d ) - 仅具有一个活动箱的竞争超立方体包装算法。作为起点,我们给出了一个简单的 1 空间有界超立方体包装算法,其竞争比为 $$ (3/2)^{d}+O((21/16)^d)$$ ( 3 / 2 ) d + O ( ( ( 21 / 16 ) d ) ,对于 $$d\ge 3.$$ d ≥ 3 。
更新日期:2020-06-05
down
wechat
bug