%O Scopus:hiba:85115621132 2022-10-11 15:00 DOI azonosĂ­tĂł nem egyezik
%C Leibniz
%T Truly Asymptotic Lower Bounds for Online Vector Bin Packing
%L publicatio35965
%S Leibniz International Proceedings in Informatics, LIPIcs
%B Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
%A  Balogh JĂĄnos
%A  Cohen Ilan Reuven
%A  Epstein Leah
%A  Levin Asaf
%N 207
%D 2021
%P 8:1-8:18
%I Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
%R MTMT:32208324 10.4230/LIPIcs.APPROX/RANDOM.2021.8