Author:
Li Sizhe,Xue Jinghui,Jin Mingming,Wang Kai,He Kun
Publisher
Springer International Publishing
Reference15 articles.
1. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: 26th Annual European Symposium on Algorithms, ESA 2018, 20–22 August 2018, Helsinki, Finland, vol. 112, pp. 5:1–5:14 (2018)
2. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. Algorithmica 83(7), 2047–2062 (2021). https://doi.org/10.1007/s00453-021-00818-7
3. Balogh, J., Békési, J., Dósa, G., Sgall, J., van Stee, R.: The optimal absolute ratio for online bin packing. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4–6 January 2015, pp. 1425–1438 (2015)
4. Lecture Notes in Computer Science;M Chrobak,2011
5. Csirik, J., Johnson, D.S.: Bounded space on-line bin packing: best is better than first. Algorithmica 31, 115–138 (2001). https://doi.org/10.1007/s00453-001-0041-7