{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:31Z","timestamp":1740109291781,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T00:00:00Z","timestamp":1591315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T00:00:00Z","timestamp":1591315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A space bounded <jats:inline-formula><jats:alternatives><jats:tex-math>$$ O(d\/\\log d)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n<mml:mrow>\n<mml:mi>O<\/mml:mi>\n<mml:mo>(<\/mml:mo>\n<mml:mi>d<\/mml:mi>\n<mml:mo>\/<\/mml:mo>\n<mml:mo>log<\/mml:mo>\n<mml:mi>d<\/mml:mi>\n<mml:mo>)<\/mml:mo>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula>-competitive hypercube packing algorithm with one active bin only is presented. As a starting point we give a simple 1-space bounded hypercube packing algorithm with competitive ratio <jats:inline-formula><jats:alternatives><jats:tex-math>$$ (3\/2)^{d}+O((21\/16)^d)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n<mml:mrow>\n<mml:msup>\n<mml:mrow>\n<mml:mo>(<\/mml:mo>\n<mml:mn>3<\/mml:mn>\n<mml:mo>\/<\/mml:mo>\n<mml:mn>2<\/mml:mn>\n<mml:mo>)<\/mml:mo>\n<\/mml:mrow>\n<mml:mi>d<\/mml:mi>\n<\/mml:msup>\n<mml:mo>+<\/mml:mo>\n<mml:mi>O<\/mml:mi>\n<mml:mrow>\n<mml:mo>(<\/mml:mo>\n<mml:msup>\n<mml:mrow>\n<mml:mo>(<\/mml:mo>\n<mml:mn>21<\/mml:mn>\n<mml:mo>\/<\/mml:mo>\n<mml:mn>16<\/mml:mn>\n<mml:mo>)<\/mml:mo>\n<\/mml:mrow>\n<mml:mi>d<\/mml:mi>\n<\/mml:msup>\n<mml:mo>)<\/mml:mo>\n<\/mml:mrow>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for <jats:inline-formula><jats:alternatives><jats:tex-math>$$d\\ge 3.$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n<mml:mrow>\n<mml:mi>d<\/mml:mi>\n<mml:mo>\u2265<\/mml:mo>\n<mml:mn>3<\/mml:mn>\n<mml:mo>.<\/mml:mo>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula><\/jats:p>","DOI":"10.1007\/s00453-020-00723-5","type":"journal-article","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T04:17:12Z","timestamp":1591330632000},"page":"3216-3249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient 1-Space Bounded Hypercube Packing Algorithm"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5987-0391","authenticated-orcid":false,"given":"Paulina","family":"Grzegorek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janusz","family":"Januszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Zielonka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"key":"723_CR1","unstructured":"Balogh, J., B\u00e9kesi, J., D\u00f3sa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: 26th Annual European Symposium on Algorithms (ESA 2018). Article No. 5; pp. 5:1\u20135:14"},{"key":"723_CR2","unstructured":"Balogh, J., B\u00e9kesi, J., D\u00f3sa, G., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. arXiv:1807.0554v1"},{"key":"723_CR3","unstructured":"Brown, D.J.: A lower bound for on-line one-dimensional bin packing algorithms. Technical Report R-864, Coordinated Sci. Lab, Urbana, Illinois (1979)"},{"key":"723_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen, H.I., Khan, A., Pokutta, S., Tetali, P.: Approximation and online algorithms for multidimensional bin packing: a survey. Comput. Sci. Rev. 24, 63\u201379 (2017). https:\/\/doi.org\/10.1016\/j.cosrev.2016.12.001","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"723_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0167-6377(89)90027-8","volume":"8","author":"D Coppersmith","year":"1989","unstructured":"Coppersmith, D., Raghavan, P.: Multidimensional on-line bin packing: algorithms and worst-case analysis. Oper. Res. Lett. 8(1), 17\u201320 (1989). https:\/\/doi.org\/10.1016\/0167-6377(89)90027-8","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"723_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(93)90009-D","volume":"45","author":"J Csirik","year":"1993","unstructured":"Csirik, J., Frenk, J., Labb\u00e9, M.: Two-dimensional rectangle packing: on-line methods and results. Discrete Appl. Math. 45(3), 197\u2013204 (1993). https:\/\/doi.org\/10.1016\/0166-218X(93)90009-D","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"723_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00453-001-0041-7","volume":"31","author":"J Csirik","year":"2001","unstructured":"Csirik, J., Johnson, D.S.: Bounded space on-line bin packing: best is better than first. Algorithmica 31(2), 115\u2013138 (2001). https:\/\/doi.org\/10.1007\/s00453-001-0041-7","journal-title":"Algorithmica"},{"issue":"2","key":"723_CR8","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0097539705446895","volume":"35","author":"L Epstein","year":"2005","unstructured":"Epstein, L., van Stee, R.: Optimal online algorithms for multidimensional packing problems. SIAM J. Comput. 35(2), 431\u2013448 (2005). https:\/\/doi.org\/10.1137\/S0097539705446895","journal-title":"SIAM J. Comput."},{"issue":"2","key":"723_CR9","first-page":"190","volume":"17","author":"P Grzegorek","year":"2014","unstructured":"Grzegorek, P., Januszewski, J.: Online algorithms for 3-space bounded 2-dimensional bin packing and square packing. Rom. J. Inf. Sci. Technol. 17(2), 190\u2013203 (2014)","journal-title":"Rom. J. Inf. Sci. Technol."},{"issue":"11","key":"723_CR10","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1016\/j.ipl.2015.06.001","volume":"115","author":"P Grzegorek","year":"2015","unstructured":"Grzegorek, P., Januszewski, J.: A note on one-space bounded square packing. Inf. Process. Lett. 115(11), 872\u2013876 (2015). https:\/\/doi.org\/10.1016\/j.ipl.2015.06.001","journal-title":"Inf. Process. Lett."},{"key":"723_CR11","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1007\/s10878-018-0338-y","volume":"37","author":"P Grzegorek","year":"2019","unstructured":"Grzegorek, P., Januszewski, J.: Drawer algorithms for 1-space bounded multidimensional hyperbox packing. J. Comb. Optim. 37, 1011\u20131044 (2019). https:\/\/doi.org\/10.1007\/s10878-018-0338-y","journal-title":"J. Comb. Optim."},{"issue":"4","key":"723_CR12","doi-asserted-by":"publisher","first-page":"50:1","DOI":"10.1145\/2000807.2000818","volume":"7","author":"X Han","year":"2011","unstructured":"Han, X., Chin, F.Y.L., Ting, H.F., Zhang, G., Zhang, Y.: A new upper bound on 2D online bin packing. ACM Trans. Algorithms 7(4), 50:1\u201350:18 (2011). https:\/\/doi.org\/10.1145\/2000807.2000818","journal-title":"ACM Trans. Algorithms"},{"key":"723_CR13","first-page":"43","volume":"93","author":"X Han","year":"2001","unstructured":"Han, X., Fujita, S., Guo, H.: A two-dimensional harmonic algorithm with performance ratio 2.7834. IPSJ SIG Not. 93, 43\u201350 (2001)","journal-title":"IPSJ SIG Not."},{"key":"723_CR14","unstructured":"Heydrich, S., van Stee, R.: Beating the harmonic lower bound for online bin packing. In: 43rd International Colloquium on Automata, Languages, and Programming, LIPIcs\u2014Leibniz International Proceedings in Informatics, vol.\u00a055, pp. 41:1\u201341:14. Schloss Dagstuhl - LZI, Wadern (2016)"},{"issue":"3","key":"723_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1004953109743","volume":"67","author":"J Januszewski","year":"1997","unstructured":"Januszewski, J., Lassak, M.: On-line packing sequences of cubes in the unit cube. Geom. Dedic. 67(3), 285\u2013293 (1997). https:\/\/doi.org\/10.1023\/A:1004953109743","journal-title":"Geom. Dedic."},{"issue":"4","key":"723_CR16","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1142\/S0129054116500076","volume":"27","author":"J Januszewski","year":"2016","unstructured":"Januszewski, J., Zielonka, \u0141.: Improved online algorithms for 2-space bounded 2-dimensional bin packing. Int. J. Found. Comput. Sci. 27(4), 407\u2013429 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"723_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1556\/012.2018.55.3.1400","volume":"55","author":"J Januszewski","year":"2018","unstructured":"Januszewski, J., Zielonka, \u0141.: Efficient online packing of 4-dimensional cubes into the unit cube. Stud. Sci. Math. Hung. 55(3), 305\u2013326 (2018). https:\/\/doi.org\/10.1556\/012.2018.55.3.1400","journal-title":"Stud. Sci. Math. Hung."},{"key":"723_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10998-020-00315-4","author":"J Januszewski","year":"2020","unstructured":"Januszewski, J., Zielonka, \u0141.: Online packing of d-dimensional boxes into the unit cube. Period. Math. Hung. (2020). https:\/\/doi.org\/10.1007\/s10998-020-00315-4","journal-title":"Period. Math. Hung."},{"issue":"3","key":"723_CR19","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8(3), 272\u2013314 (1974). https:\/\/doi.org\/10.1016\/S0022-0000(74)80026-7","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"723_CR20","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"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(4), 299\u2013325 (1974). https:\/\/doi.org\/10.1137\/0203025","journal-title":"SIAM J. Comput."},{"issue":"3","key":"723_CR21","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J. ACM 32(3), 562\u2013572 (1985). https:\/\/doi.org\/10.1145\/3828.3833","journal-title":"J. ACM"},{"issue":"2","key":"723_CR22","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0020-0190(80)90077-0","volume":"10","author":"FM Liang","year":"1980","unstructured":"Liang, F.M.: A lower bound for on-line bin packing. Inf. Process. Lett. 10(2), 76\u201379 (1980). https:\/\/doi.org\/10.1016\/S0020-0190(80)90077-0","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"723_CR23","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","volume":"10","author":"P Ramanan","year":"1989","unstructured":"Ramanan, P., Brown, D.J., Lee, C., Lee, D.: On-line bin packing in linear time. J. Algorithms 10(3), 305\u2013326 (1989). https:\/\/doi.org\/10.1016\/0196-6774(89)90031-X","journal-title":"J. Algorithms"},{"issue":"5","key":"723_CR24","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"SS Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. ACM 49(5), 640\u2013671 (2002). https:\/\/doi.org\/10.1145\/585265.585269","journal-title":"J. ACM"},{"issue":"3","key":"723_CR25","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"SS Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R.: New bounds for multidimensional packing. Algorithmica 36(3), 261\u2013293 (2003). https:\/\/doi.org\/10.1007\/s00453-003-1016-7","journal-title":"Algorithmica"},{"key":"723_CR26","unstructured":"Sloane, N.J.A.: Gould\u2019s sequence. https:\/\/oeis.org\/A001316"},{"key":"723_CR27","unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University. Department of Electrical Engineering. Computer Sciences Laboratory (1971)"},{"issue":"5","key":"723_CR28","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A van Vliet","year":"1992","unstructured":"van Vliet, A.: An improved lower bound for on-line bin packing algorithms. Inf. Process. Lett. 43(5), 277\u2013284 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90223-I","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"723_CR29","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0406045","volume":"6","author":"G Woeginger","year":"1993","unstructured":"Woeginger, G.: Improved space for bounded-space, on-line bin-packing. SIAM J. Discrete Math. 6(4), 575\u2013581 (1993). https:\/\/doi.org\/10.1137\/0406045","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"723_CR30","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"ACC Yao","year":"1980","unstructured":"Yao, A.C.C.: New algorithms for bin packing. J. ACM 27(2), 207\u2013227 (1980). https:\/\/doi.org\/10.1145\/322186.322187","journal-title":"J. ACM"},{"issue":"2","key":"723_CR31","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10878-012-9457-z","volume":"26","author":"Y Zhang","year":"2013","unstructured":"Zhang, Y., Chin, F.Y.L., Ting, H.F., Han, X.: Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing. J. Comb. Optim. 26(2), 223\u2013236 (2013). https:\/\/doi.org\/10.1007\/s10878-012-9457-z","journal-title":"J. Comb. Optim."},{"key":"723_CR32","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2014.02.045","volume":"554","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Chin, F.Y.L., Ting, H.F., Han, X., Poon, C.K., Tsin, Y.H., Ye, D.: Online algorithms for 1-space bounded 2-dimensional bin packing and square packing. Theor. Comput. Sci. 554, 135\u2013149 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.02.045","journal-title":"Theor. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00723-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00723-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00723-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T23:34:44Z","timestamp":1622849684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00723-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,5]]},"references-count":32,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["723"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00723-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2020,6,5]]},"assertion":[{"value":"24 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}