relation: http://publicatio.bibl.u-szeged.hu/35965/
title: Truly Asymptotic Lower Bounds for Online Vector Bin Packing
creator:  Balogh János
creator:  Cohen Ilan Reuven
creator:  Epstein Leah
creator:  Levin Asaf
subject: 01.02. Számítás- és információtudomány
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
date: 2021
type: Könyv része
type: NonPeerReviewed
format: text
identifier: http://publicatio.bibl.u-szeged.hu/35965/1/LIPIcs.APPROX-RANDOM.2021.8.pdf
identifier:     Balogh János;  Cohen Ilan Reuven;  Epstein Leah;  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     
identifier: doi:10.4230/LIPIcs.APPROX/RANDOM.2021.8
relation: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.8
relation: 32208324
language: eng
relation: info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.APPROX/RANDOM.2021.8
rights: info:eu-repo/semantics/openAccess