A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
From MaRDI portal
Publication:2294729
DOI10.1007/978-3-319-77404-6_51zbMath1504.68291arXiv1712.06763OpenAlexW2964158392WikidataQ101496262 ScholiaQ101496262MaRDI QIDQ2294729
Yoshiko Wakabayashi, Yoshiharu Kohayakawa, Flávio K. Miyazawa
Publication date: 12 February 2020
Full work available at URL: https://arxiv.org/abs/1712.06763
Games involving graphs (91A43) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Prices of Anarchy of Selfish 2D Bin Packing Games ⋮ A tight lower bound for the online bounded space hypercube bin packing problem
This page was built for publication: A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game