Skip to main content
SpringerLink
Log in

Lower Bounds for Several Online Variants of Bin Packing

  • Conference paper
  • First Online:
Approximation and Online Algorithms (WAOA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10787))

Included in the following conference series:

Abstract

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.

Gy. Dósa was supported by VKSZ_12-1-2013-0088 “Development of cloud based smart IT solutions by IBM Hungary in cooperation with the University of Pannonia” 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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Angelopoulos, S., Dürr, C., Kamali, S., Renault, M., Rosén, A.: Online bin packing with advice of small size. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 40–53. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21840-3_4

    Chapter  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  4. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: Online bin packing with cardinality constraints resolved. The Computing Research Repository (CoRR) (2016). http://arxiv.org/abs/1608.06415. Also in ESA 2017 (to appear)

  5. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. The Computing Research Repository (CoRR) (2017). http://arxiv.org/abs/1707.01728

  6. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: Lower bounds for several online variants of bin packing. The Computing Research Repository (CoRR) (2017). http://arxiv.org/abs/1708.03228

  7. Balogh, J., Békési, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theoret. Comput. Sci. 440–441, 1–13 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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)

    Article  MathSciNet  MATH  Google Scholar 

  9. Békési, J., Dósa, G., Epstein, L.: Bounds for online bin packing with cardinality constraints. Inf. Comput. 249, 190–204 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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 

  11. Boyar, J., Kamali, S., Larsen, K.S., López-Ortiz, A.: Online bin packing with advice. Algorithmica 74(1), 507–527 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  12. Coppersmith, D., Raghavan, P.: Multidimensional online bin packing: algorithms and worst case analysis. Oper. Res. Lett. 8(1), 17–20 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  13. Epstein, L.: Online bin packing with cardinality constraints. SIAM J. Discret. Math. 20(4), 1015–1030 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Epstein, L., Imreh, C., Levin, A.: Class constrained bin packing revisited. Theoret. Comput. Sci. 411(34–36), 3073–3089 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Epstein, L., Levin, A.: On bin packing with conflicts. SIAM J. Optim. 19(3), 1270–1298 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Epstein, L., Levin, A.: Robust approximation schemes for cube packing. SIAM J. Optim. 23(2), 1310–1343 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  17. Epstein, L., van Stee, R.: Online square and cube packing. Acta Inform. 41(9), 595–606 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Fujiwara, H., Kobayashi, K.: Improved lower bounds for the online bin packing problem with cardinality constraints. J. Comb. Optim. 29(1), 67–87 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  19. Heydrich, S., van Stee, R.: Improved lower bounds for online hypercube packing. The Computing Research Repository (CoRR) (2016). http://arxiv.org/abs/1607.01229

  20. Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272–314 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  21. 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)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kellerer, H., Pferschy, U.: Cardinality constrained bin-packing problems. Ann. Oper. Res. 92, 335–348 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  23. 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)

    Article  MathSciNet  MATH  Google Scholar 

  24. Liang, F.M.: A lower bound for on-line bin packing. Inf. Process. Lett. 10(2), 76–79 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  25. Seiden, S.S.: On the online bin packing problem. J. ACM 49(5), 640–671 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  26. Seiden, S.S., van Stee, R.: New bounds for multi-dimensional packing. Algorithmica 36(3), 261–293 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  27. Shachnai, H., Tamir, T.: Tight bounds for online class-constrained packing. Theoret. Comput. Sci. 321(1), 103–123 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  28. Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. J. Sched. 4(6), 313–338 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  29. Ullman, J.D.: The performance of a memory allocation algorithm. Technical report 100, Princeton University, Princeton, NJ (1971)

    Google Scholar 

  30. van Vliet, A.: An improved lower bound for online bin packing algorithms. Inf. Process. Lett. 43(5), 277–284 (1992)

    Article  MATH  Google Scholar 

  31. Xavier, E.C., Miyazawa, F.K.: The class constrained bin packing problem with applications to video-on-demand. Theoret. Comput. Sci. 393(1–3), 240–259 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  32. Yao, A.C.C.: New algorithms for bin packing. J. ACM 27, 207–227 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Informatics, Gyula Juhász Faculty of Education, University of Szeged, Szeged, Hungary

    János Balogh & József Békési

  2. Department of Mathematics, University of Pannonia, Veszprem, Hungary

    György Dósa

  3. Department of Mathematics, University of Haifa, Haifa, Israel

    Leah Epstein

  4. Faculty of Industrial Engineering and Management, The Technion, Haifa, Israel

    Asaf Levin

Authors
  1. János Balogh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. József Békési
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. György Dósa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Asaf Levin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Asaf Levin .

Editor information

Editors and Affiliations

  1. The University of Western Ontario, London, Ontario, Canada

    Roberto Solis-Oba

  2. German University of Technology in Oman, Muscat, Oman

    Rudolf Fleischer

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A. (2018). Lower Bounds for Several Online Variants of Bin Packing. In: Solis-Oba, R., Fleischer, R. (eds) Approximation and Online Algorithms. WAOA 2017. Lecture Notes in Computer Science(), vol 10787. Springer, Cham. https://doi.org/10.1007/978-3-319-89441-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-89441-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-89440-9

  • Online ISBN: 978-3-319-89441-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation