Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Approximation and Online Algorithms

WAOA 2017: Approximation and Online Algorithms pp 147–163Cite as

Online Packing of Rectangular Items into Square Bins

  • Conference paper
  • First Online:

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

Abstract

Any list of rectangular items of total area not greater than 0.2837 can be packed online into the unit square (\(90^{\circ }\)-rotations are allowed). Furthermore, we describe a 4.84-competitive 1-space bounded 2-dimensional bin packing algorithm and present the lower bound of 3.246 for the competitive ratio.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Brubach, B.: Improved online square-into-square packing. arxiv.org/pdf/1401.5583.pdf

  2. Brubach, B.: Improved bound for online square-into-square packing. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 47–58. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18263-6_5

    Google Scholar 

  3. Zhang, Y., Chen, J., Chin, F.Y.L., Han, X., Ting, H.-F., Tsin, Y.H.: Improved online algorithms for 1-space bounded 2-dimensional bin packing. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 242–253. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17514-5_21

    Chapter  Google Scholar 

  4. Chin, F.Y.L., Han, X., Poon, C.K., Ting, H.-F., Tsin, Y.H., Ye, D., Zhang, Y.: Online algorithms for 1-space bounded 2-dimensional bin packing and square packing. Theor. Comput. Sci. 554, 135–149 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chin, F.Y.L., Ting, H.-F., Zhang, Y.: 1-space bounded algorithms for 2-dimensional bin packing. In: Proceedings of the 20th Annual International Symposium on Algorithms and Computation (ISAAC), pp. 321–330 (2009)

    Google Scholar 

  6. Chin, F.Y.L., Ting, H.-F., Zhang, Y.: One-space bounded algorithms for two-dimensional bin packing. Int. J. Found. Comput. Sci. 21(6), 875–891 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Epstein, L., van Stee, R.: Optimal online algorithms for multidimensional packing problems. SIAM J. Comput. 35(2), 431–448 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fekete, S.P., Hoffmann, H.-F.: Online square-into-square packing. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX/RANDOM -2013. LNCS, vol. 8096, pp. 126–141. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40328-6_10

    Chapter  Google Scholar 

  9. Grzegorek, P., Januszewski, J.: Online algorithms for \(3\)-space bounded \(2\)-dimensional bin packing and square packing. Rom. J. Inf. Sci. Technol. 17(2), 189–202 (2014)

    Google Scholar 

  10. Grzegorek, P., Januszewski, J.: A note on one-space bounded square packing. Inf. Process. Lett. 115, 872–876 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  11. Han, X., Iwama, K., Zhang, G.: Online removable square packing. Theory Comput. Syst. 43(1), 38–55 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Januszewski, J.: Packing rectangles into the unit square. Geom. Dedicata 8, 13–18 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Januszewski, J., Lassak, M.: On-line packing sequences of cubes in the unit cube. Geom. Dedicata 67, 285–293 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Januszewski, J., Zielonka, Ł.: Improved online algorithms for 2-space bounded 2-dimensional bin packing. Int. J. Found. Comput. Sci. 27(4), 407–429 (2016)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Lassak, M.: On-line potato-sack algorithm efficient for packing into small boxes. Periodica Math. Hung. 34, 105–110 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lee, C.C., Lee, D.T.: A simple on-line bin packing algorithm. J. ACM 32, 562–572 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  18. Moser, L.: Poorly formulated unsolved problems of combinatorial geometry. Mimeographed (1966)

    Google Scholar 

  19. Moon, J., Moser, L.: Some packing and covering theorems. Colloq. Math. 17, 103–110 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  20. Zhao, X., Shen, H.: On-line algorithms for 2-space bounded cube and hypercube packing. Tsinghua Sci. Technol. 20(3), 255–263 (2015)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Physics, UTP University of Science and Technology, Al. Prof. S. Kaliskiego 7, 85-789, Bydgoszcz, Poland

    Janusz Januszewski & Łukasz Zielonka

Authors
  1. Janusz Januszewski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Łukasz Zielonka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Łukasz Zielonka .

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

Januszewski, J., Zielonka, Ł. (2018). Online Packing of Rectangular Items into Square Bins. 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_12

Download citation

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

  • 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