Funder
Israel Science Foundation
Hungarian Scientific Research Fund
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference17 articles.
1. Balogh J, Békési J, Galambos G (2012) New lower bounds for certain bin packing algorithms. Theor Comput Sci 1:1–13
2. Balogh J, Békési J, Dósa G, Galambos G, Tan Z (2016) Lower bound for 3-batched bin packing. Discrete Optim 21:14–24
3. Balogh J, Békési J, Dósa G, Epstein L, Levin A (2018) A new and improved algorithm for online bin packing. In: Proceedings of the 26th European symposium on algorithms (ESA2018), pp 5:1–5:14
4. Balogh J, Békési J, Dósa G, Epstein L, Levin A (2019a) Lower bounds for several online variants of bin packing. Theory Comput Syst 63(8):1757–1780
5. Balogh J, Békési J, Dósa G, Epstein L, Levin A (2019b) A new lower bound for classic online bin packing. In: Proceedings of the 17th workshop on approximation and online algorithms (WAOA2019), pp 18–28
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献