A tight lower bound for the online bounded space hypercube bin packing problem
Discrete mathematics & theoretical computer science, Tome 23 (2021-2022) no. 3.

Voir la notice de l'article provenant de la source Episciences

In the $d$-dimensional hypercube bin packing problem, a given list of $d$-dimensional hypercubes must be packed into the smallest number of hypercube bins. Epstein and van Stee [SIAM J. Comput. 35 (2005)] showed that the asymptotic performance ratio $\rho$ of the online bounded space variant is $\Omega(\log d)$ and $O(d/\log d)$, and conjectured that it is $\Theta(\log d)$. We show that $\rho$ is in fact $\Theta(d/\log d)$, using probabilistic arguments.
DOI : 10.46298/dmtcs.8325
Classification : 05C70
@article{DMTCS_2021_23_3_a4,
     author = {Kohayakawa, Yoshiharu and Miyazawa, Fl\'avio Keidi and Wakabayashi, Yoshiko},
     title = {A tight lower bound for the online bounded space hypercube bin packing problem},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {23},
     number = {3},
     year = {2021-2022},
     doi = {10.46298/dmtcs.8325},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.8325/}
}
TY  - JOUR
AU  - Kohayakawa, Yoshiharu
AU  - Miyazawa, Flávio Keidi
AU  - Wakabayashi, Yoshiko
TI  - A tight lower bound for the online bounded space hypercube bin packing problem
JO  - Discrete mathematics & theoretical computer science
PY  - 2021-2022
VL  - 23
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.8325/
DO  - 10.46298/dmtcs.8325
LA  - en
ID  - DMTCS_2021_23_3_a4
ER  - 
%0 Journal Article
%A Kohayakawa, Yoshiharu
%A Miyazawa, Flávio Keidi
%A Wakabayashi, Yoshiko
%T A tight lower bound for the online bounded space hypercube bin packing problem
%J Discrete mathematics & theoretical computer science
%D 2021-2022
%V 23
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.8325/
%R 10.46298/dmtcs.8325
%G en
%F DMTCS_2021_23_3_a4
Kohayakawa, Yoshiharu; Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko. A tight lower bound for the online bounded space hypercube bin packing problem. Discrete mathematics & theoretical computer science, Tome 23 (2021-2022) no. 3. doi : 10.46298/dmtcs.8325. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.8325/

Cité par Sources :