{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T11:07:04Z","timestamp":1768993624819,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T00:00:00Z","timestamp":1670803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T00:00:00Z","timestamp":1670803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00453-022-01078-9","type":"journal-article","created":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T13:02:35Z","timestamp":1670850155000},"page":"1415-1458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online Bin Packing of Squares and Cubes"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6761-8521","authenticated-orcid":false,"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Loay","family":"Mualem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,12]]},"reference":[{"key":"1078_CR1","doi-asserted-by":"crossref","unstructured":"Azar, Y., Cohen, I.R., Kamara, S., Shepherd, F.B.: Tight bounds for online vector bin packing. In Proceedings of the 45th ACM Symposium on Theory of Computing (STOC\u201913), pp. 961\u2013970, (2013)","DOI":"10.1145\/2488608.2488730"},{"key":"1078_CR2","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, Gy., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In Proceedings of the 26th European Symposium on Algorithms (ESA\u201918), pp. 5:1\u20135:14, (2018)"},{"issue":"8","key":"1078_CR3","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1007\/s00224-019-09915-1","volume":"63","author":"J Balogh","year":"2019","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, Gy., Epstein, L., Levin, A.: Lower bounds for several online variants of bin packing. Theory Comput. Syst. 63(8), 1757\u20131780 (2019)","journal-title":"Theory Comput. Syst."},{"key":"1078_CR4","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, Gy., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. (2018) CoRR, arXiv:1807.05554, Also in Proceedings of the WAOA\u201919"},{"key":"1078_CR5","first-page":"1","volume":"440\u2013441","author":"J Balogh","year":"2012","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theory Comput. Syst. 440\u2013441, 1\u201313 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"1078_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/moor.1050.0168","volume":"31","author":"N Bansal","year":"2006","unstructured":"Bansal, N., Correa, J.R., Kenyon, C., Sviridenko, M.: Bin packing in multiple dimensions: inapproximability results and approximation schemes. Math. Oper. Res. 31(1), 31\u201349 (2006)","journal-title":"Math. Oper. Res."},{"key":"1078_CR7","unstructured":"Blitz, D.: Lower bounds on the asymptotic worst-case ratios of on-line bin packing algorithms. Master\u2019s thesis, University of Rotterdam, Rotterdam, The Netherlands (1996)"},{"key":"1078_CR8","unstructured":"Blitz, D., Heydrich, S., van Stee, R., van Vliet, A., Woeginger, G.J.: Improved lower bounds for online hypercube and rectangle packing. (2016) CoRR, arXiv:1607.01229v2"},{"key":"1078_CR9","unstructured":"Brown, D.J.: A lower bound for on-line one-dimensional bin packing algorithms. Coordinated Science Laboratory Report no. R-864 (UILU-ENG 78-2257), (1979)"},{"key":"1078_CR10","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.: Multidimensional bin packing and other related problems: a survey. Comput. Sci. Rev. 24, 63\u201379 (2017)","journal-title":"Comput. Sci. Rev."},{"key":"1078_CR11","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"EG Coffman Jr","year":"1996","unstructured":"Coffman, E.G., Jr., Garey, M., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46\u201393. PWS Publishing Co., Boston (1996)"},{"key":"1078_CR12","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 online bin packing: algorithms and worst case analysis. Oper. Res. Lett. 8, 17\u201320 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1078_CR13","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.B.G., Labbe, M.: Two-dimensional rectangle packing: on-line methods and results. Discret. Appl. Math. 45(3), 197\u2013204 (1993)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1078_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(93)90004-Z","volume":"13","author":"J Csirik","year":"1993","unstructured":"Csirik, J., van Vliet, A.: An on-line algorithm for multidimensional bin packing. Oper. Res. Lett. 13(3), 149\u2013158 (1993)","journal-title":"Oper. Res. Lett."},{"key":"1078_CR15","doi-asserted-by":"crossref","unstructured":"Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art. pp. 147\u2013177 (1998)","DOI":"10.1007\/BFb0029568"},{"issue":"31\u201333","key":"1078_CR16","doi-asserted-by":"publisher","first-page":"2899","DOI":"10.1016\/j.tcs.2010.04.021","volume":"411","author":"L Epstein","year":"2010","unstructured":"Epstein, L.: Two-dimensional online bin packing with rotation. Theoret. Comput. Sci. 411(31\u201333), 2899\u20132911 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"1078_CR17","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1007\/s10878-019-00423-z","volume":"38","author":"L Epstein","year":"2019","unstructured":"Epstein, L.: A lower bound for online rectangle packing. J. Comb. Optim. 38(3), 846\u2013866 (2019)","journal-title":"J. Comb. Optim."},{"issue":"9","key":"1078_CR18","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00236-005-0169-z","volume":"41","author":"L Epstein","year":"2005","unstructured":"Epstein, L., van Stee, R.: Online square and cube packing. Acta Inf. 41(9), 595\u2013606 (2005)","journal-title":"Acta Inf."},{"issue":"2","key":"1078_CR19","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)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1078_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.disopt.2006.11.005","volume":"4","author":"L Epstein","year":"2007","unstructured":"Epstein, L., van Stee, R.: Bounds for online bounded space hypercube packing. Discret. Optim. 4(2), 185\u2013197 (2007)","journal-title":"Discret. Optim."},{"issue":"4","key":"1078_CR21","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega, W., Lueker, G.S.: within $$1+\\varepsilon $$ in linear time. Combinatorica 1(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"issue":"2","key":"1078_CR22","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/S0304-3975(01)00410-8","volume":"289","author":"S Fujita","year":"2002","unstructured":"Fujita, S., Hada, T.: Two-dimensional on-line bin packing problem with rotatable items. Theoret. Comput. Sci. 289(2), 939\u2013952 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"1078_CR23","first-page":"21","volume":"10","author":"G Galambos","year":"1991","unstructured":"Galambos, G.: A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing. Acta Cybern. 10(1\u20132), 21\u201324 (1991)","journal-title":"Acta Cybern."},{"issue":"3","key":"1078_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02246509","volume":"52","author":"G Galambos","year":"1994","unstructured":"Galambos, G., van Vliet, A.: Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms. Computing 52(3), 281\u2013297 (1994)","journal-title":"Computing"},{"key":"1078_CR25","volume-title":"Computers and Intractability: A Guide to the Theory of of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of of NP-Completeness. Freeman and Company, San Francisco (1979)"},{"issue":"4","key":"1078_CR26","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2000807.2000818","volume":"7","author":"X Han","year":"2011","unstructured":"Han, X., Chin, F.Y., Ting, H.-F., Zhang, G., Zhang, Y.: A new upper bound 2.5545 on 2d online bin packing. ACM Trans. Algorithms 7(4), 50 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"1078_CR27","unstructured":"Han, X., Ye, D., Zhou, Y.: Improved online hypercube packing. (2016) CoRR, arXiv:cs\/0607045, Also in Proceedings of the WAOA\u201906"},{"issue":"2","key":"1078_CR28","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10100-009-0109-z","volume":"18","author":"X Han","year":"2010","unstructured":"Han, X., Ye, D., Zhou, Y.: A note on online hypercube packing. CEJOR 18(2), 221\u2013239 (2010)","journal-title":"CEJOR"},{"key":"1078_CR29","unstructured":"Heydrich, S., van Stee, R.: Beating the harmonic lower bound for online bin packing. In Proceedings of 43rd International Colloquium on Automata, Languages, and Programming (ICALP\u201916), pp. 41:1\u201341:14 (2016)"},{"issue":"3","key":"1078_CR30","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"1078_CR31","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., Garey, M., Graham, R.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299\u2013325 (1974)","journal-title":"SIAM J. Comput."},{"key":"1078_CR32","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS\u201982), pp. 312\u2013320, (1982)","DOI":"10.1109\/SFCS.1982.61"},{"issue":"2","key":"1078_CR33","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)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"1078_CR34","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 online bin packing algorithm. J. ACM 32(3), 562\u2013572 (1985)","journal-title":"J. ACM"},{"issue":"1\u20133","key":"1078_CR35","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0304-3975(02)00647-3","volume":"297","author":"FK Miyazawa","year":"2003","unstructured":"Miyazawa, F.K., Wakabayashi, Y.: Cube packing. Theoret. Comput. Sci. 297(1\u20133), 355\u2013366 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"1078_CR36","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.C., Lee, D.T.: Online bin packing in linear time. J. Algorithms 10(3), 305\u2013326 (1989)","journal-title":"J. Algorithms"},{"issue":"3","key":"1078_CR37","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1137\/140955367","volume":"45","author":"T Rothvoss","year":"2016","unstructured":"Rothvoss, T.: Better bin packing approximations via discrepancy theory. SIAM J. Comput. 45(3), 930\u2013946 (2016)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"1078_CR38","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)","journal-title":"J. ACM"},{"issue":"3","key":"1078_CR39","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)","journal-title":"Algorithmica"},{"issue":"4","key":"1078_CR40","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Nav. Res. Logist. 41(4), 579\u2013585 (1994)","journal-title":"Nav. Res. Logist."},{"key":"1078_CR41","volume-title":"The performance of a memory allocation algorithm. Technical Report 100","author":"JD Ullman","year":"1971","unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100. Princeton University, Princeton (1971)"},{"issue":"5","key":"1078_CR42","doi-asserted-by":"crossref","first-page":"227","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 online bin packing algorithms. Inf. Process. Lett. 43(5), 227\u2013284 (1992)","journal-title":"Inf. Process. Lett."},{"key":"1078_CR43","unstructured":"van Vliet, A.: Lower and upper bounds for online bin packing and scheduling heuristics. PhD thesis, Erasmus University, Rotterdam, The Netherlands (1995)"},{"key":"1078_CR44","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0406045","volume":"6","author":"GJ Woeginger","year":"1993","unstructured":"Woeginger, G.J.: Improved space for bounded-space online bin packing. SIAM J. Discret. Math. 6, 575\u2013581 (1993)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"1078_CR45","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)","journal-title":"J. ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01078-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01078-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01078-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T00:03:52Z","timestamp":1682381032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01078-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,12]]},"references-count":45,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1078"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01078-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,12]]},"assertion":[{"value":"5 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no conflicts of interest or competing interests for this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}