Theory of Computing Systems

, Volume 63, Issue 8, pp 1757–1780 | Cite as

Lower Bounds for Several Online Variants of Bin Packing

  • János BaloghEmail author
  • József Békési
  • György Dósa
  • Leah Epstein
  • Asaf Levin
Part of the following topical collections:
  1. Special Issue on Approximation and Online Algorithms (2017)


We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.


Bin packing Online algorithms Lower bounds Competitive ratio 



An extended abstract version appears in the Proceedings of WAOA2017. J. Balogh was supported by the project “Integrated program for training new generation of scientists in the fields of computer science”, no. EFOP-3.6.3-VEKOP-16-2017-0002. J. Békési was supported by the EU-funded Hungarian grant EFOP-3.6.2-16-2017-00015. Gy. Dósa was supported by Szechenyi 2020 under the EFOP-3.6.1-16-2016-00015 and by National Research, Development and Innovation Office NKFIH under the grant SNN 116095. L. Epstein and A. Levin were partially supported by a grant from GIF - the German-Israeli Foundation for Scientific Research and Development (grant number I-1366-407.6/2016).


  1. 1.
    Angelopoulos, S., Du̇rr, C., Kamali, S., Renault, M.P., Rosėn, A.: Online bin packing with advice of small size. In: Proceedings of The 14th International Symposium Algorithms and Data Structures (WADS’15), pp. 40–53 (2015)Google Scholar
  2. 2.
    Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discret. Appl. Math. 143(1-3), 238–251 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Balogh, J., Békési, J.: Semi-on-line bin packing: a short overview and a new lower bound. CEJOR 21(4), 685–698 (2013)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Balogh, J., Békési, J., Dósa, Gy., Epstein, L., Levin, A.: Online bin packing with cardinality constraints resolved. The Computing Res. Rep. (CoRR), arXiv:1608.06415 (2016)
  5. 5.
    Balogh, J., Békési, J., Dósa, Gy., Epstein, L., Levin, A.: Online bin packing with cardinality constraints resolved. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA’17), pp. 10:1–10:14 (2017)Google Scholar
  6. 6.
    Balogh, J., Békési, J., Dósa, Gy., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: Proceedings of the 26th annual European symposium on algorithms (ESA18), pp 5:1–5:14 (2018)Google Scholar
  7. 7.
    Balogh, J., Békési, J., Dósa, Gy., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. The Computing Res. Rep. (CoRR), arXiv:1807.05554 (2018)
  8. 8.
    Balogh, J., Békési, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theor. Comput. Sci. 440-441, 1–13 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Bansal, N., Correa, J., Kenyon, C., Sviridenko, M.: Bin packing in multiple dimensions Inapproximability results and approximation schemes. Math. Oper. Res. 31(1), 31–49 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Békési, J., Dósa, Gy., Epstein, L.: Bounds for online bin packing with cardinality constraints. Inf. Comput. 249, 190–204 (2016)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Blitz, D.: Lower bounds on the asymptotic worst-case ratios of on-line bin packing algorithms. M.Sc. thesis, University of Rotterdam, number 114682 (1996)Google Scholar
  12. 12.
    Boyar, J., Kamali, S., Larsen, K.S., López-Ortiz, A.: Online bin packing with advice. Algorithmica 74(1), 507–527 (2016)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Coppersmith, D., Raghavan, P.: Multidimensional online bin packing: Algorithms and worst case analysis. Oper. Res. Lett. 8(1), 17–20 (1989)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Epstein, L.: Online bin packing with cardinality constraints. SIAM J. Discret. Math. 20(4), 1015–1030 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Epstein, L., Imreh, Cs., Levin, A.: Class constrained bin packing revisited. Theor. Comput. Sci. 411(34-36), 3073–3089 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Epstein, L., Levin, A.: On bin packing with conflicts. SIAM J. Optim. 19 (3), 1270–1298 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Epstein, L., Levin, A.: Robust approximation schemes for cube packing. SIAM J. Optim. 23(2), 1310–1343 (2013)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Epstein, L., van Stee, R.: Online square and cube packing. Acta Informatica 41(9), 595–606 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    Epstein, L., Tushia, A.: Work in progress (2018)Google Scholar
  20. 20.
    Fujiwara, H., Kobayashi, K.: Improved lower bounds for the online bin packing problem with cardinality constraints. J. Comb. Optim. 29(1), 67–87 (2015)MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    Han, X., Ye, D., Zhou, Y.: A note on online hypercube packing. CEJOR 18(2), 221–239 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Heydrich, S., van Stee, R.: Improved Lower Bounds for Online Hypercube Packing. The Computing Res. Rep. (CoRR), arXiv:1607.01229 (2016)
  23. 23.
    Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272–314 (1974)MathSciNetzbMATHCrossRefGoogle Scholar
  24. 24.
    Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3, 256–278 (1974)MathSciNetzbMATHCrossRefGoogle Scholar
  25. 25.
    Kellerer, H., Pferschy, U.: Cardinality constrained bin-packing problems. Ann. Oper. Res. 92, 335–348 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  26. 26.
    Krause, K.L., Shen, V.Y., Schwetman, H.D.: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J. ACM 22(4), 522–550 (1975)MathSciNetzbMATHCrossRefGoogle Scholar
  27. 27.
    Liang, F.M.: A lower bound for on-line bin packing. Inf. Process. Lett. 10(2), 76–79 (1980)MathSciNetzbMATHCrossRefGoogle Scholar
  28. 28.
    Seiden, S.S.: On the online bin packing problem. J. ACM 49(5), 640–671 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  29. 29.
    Seiden, S.S., van Stee, R.: New bounds for multi-dimensional packing. Algorithmica 36(3), 261–293 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  30. 30.
    Shachnai, H., Tamir, T.: Tight bounds for online class-constrained packing. Theor. Comput. Sci. 321(1), 103–123 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  31. 31.
    Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. J. Sched. 4(6), 313–338 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  32. 32.
    Ullman, J.D.: The Performance of a Memory Allocation Algorithm. Technical Report, vol. 100. Princeton University, Princeton (1971)Google Scholar
  33. 33.
    van Vliet, A.: An improved lower bound for online bin packing algorithms. Inf. Process. Lett. 43(5), 277–284 (1992)zbMATHCrossRefGoogle Scholar
  34. 34.
    Xavier, E.C., Miyazawa, F.K.: The class constrained bin packing problem with applications to video-on-demand. Theor. Comput. Sci. 393(1-3), 240–259 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  35. 35.
    Yao, A.C.C.: New algorithms for bin packing. J. ACM 27, 207–227 (1980)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  • János Balogh
    • 1
    Email author
  • József Békési
    • 1
  • György Dósa
    • 2
  • Leah Epstein
    • 3
  • Asaf Levin
    • 4
  1. 1.Department of Applied Informatics, Gyula Juhász Faculty of EducationUniversity of SzegedSzegedHungary
  2. 2.Department of MathematicsUniversity of PannoniaVeszprémHungary
  3. 3.Department of MathematicsUniversity of HaifaHaifaIsrael
  4. 4.Faculty of Industrial Engineering and Management, The TechnionHaifaIsrael

Personalised recommendations