Truly Asymptotic Lower Bounds for Online Vector Bin Packing

Balogh János and Cohen Ilan Reuven and Epstein Leah and Levin Asaf: Truly Asymptotic Lower Bounds for Online Vector Bin Packing.
In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics, LIPIcs (207). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz, 8:1-8:18. (2021) ISBN 9783959772075

[thumbnail of LIPIcs.APPROX-RANDOM.2021.8.pdf]
Preview
Text
LIPIcs.APPROX-RANDOM.2021.8.pdf - Published Version

Download (739kB) | Preview
Creators:
Balogh János MTMT
Cohen Ilan Reuven
Epstein Leah
Levin Asaf
Item Type: Book Section
Date: 2021
Number: 207
Number of Pages: 18
Page Range: 8:1-8:18
Publication identifier: 8
ISBN: 9783959772075
Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Place of Publication: Leibniz
Faculty/Unit: Faculty of Science and Informatics
Institution: University of Szeged (2000-)
Language: English
MTMT rekordazonosító: 32208324
DOI azonosító: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.8
Date Deposited: 2025. Feb. 10. 12:30
Last Modified: 2025. Feb. 10. 12:31
URI: http://publicatio.bibl.u-szeged.hu/id/eprint/35965

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year