Efficient 1-Space Bounded Hypercube Packing Algorithm-Reference-Cited by-同舟云学术

Efficient 1-Space Bounded Hypercube Packing Algorithm

Published:2020-06-05 Issue:11 Volume:82 Page:3216-3249
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Grzegorek Paulina^ORCID,Januszewski Janusz,Zielonka Łukasz

Abstract

AbstractA 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 .

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00453-020-00723-5.pdf

Reference32 articles.

1. Balogh, J., Békesi, J., Dósa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: 26th Annual European Symposium on Algorithms (ESA 2018). Article No. 5; pp. 5:1–5:14

2. Balogh, J., Békesi, J., Dósa, G., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. arXiv:1807.0554v1

3. Brown, D.J.: A lower bound for on-line one-dimensional bin packing algorithms. Technical Report R-864, Coordinated Sci. Lab, Urbana, Illinois (1979)

4. Christensen, H.I., Khan, A., Pokutta, S., Tetali, P.: Approximation and online algorithms for multidimensional bin packing: a survey. Comput. Sci. Rev. 24, 63–79 (2017). https://doi.org/10.1016/j.cosrev.2016.12.001

5. Coppersmith, D., Raghavan, P.: Multidimensional on-line bin packing: algorithms and worst-case analysis. Oper. Res. Lett. 8(1), 17–20 (1989). https://doi.org/10.1016/0167-6377(89)90027-8