Funder
German-Israeli Foundation for Scientific Research and Development
Israel Science Foundation
European Social Fund
Hungarian Scientific Research Fund
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference23 articles.
1. Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Appl. Math. 143(1–3), 238–251 (2004)
2. Balogh, J., Békési, J., Dósa, Gy., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: Proc. of the 26th European Symposium on Algorithms (ESA2018), pp. 5:1–5:14 (2018)
3. Balogh, J., Békési, J., Dósa, Gy., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. In: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA2019), pp. 18–28 (2019)
4. Online bin packing with cardinality constraints resolved: J. Comput. Syst. Sci. 112, 34–49 (2020)
5. Balogh, J., Békési, J., Dósa, Gy., Galambos, G., Tan, Z.: Lower bound for 3-batched bin packing. Discrete Optim. 21, 14–24 (2016)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献