{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:13:06Z","timestamp":1773778386398,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T00:00:00Z","timestamp":1615766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T00:00:00Z","timestamp":1615766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001736","name":"German-Israeli Foundation for Scientific Research and Development","doi-asserted-by":"crossref","award":["I-1366-407.6\/2016"],"award-info":[{"award-number":["I-1366-407.6\/2016"]}],"id":[{"id":"10.13039\/501100001736","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001736","name":"German-Israeli Foundation for Scientific Research and Development","doi-asserted-by":"publisher","award":["I-1366-407.6\/2016"],"award-info":[{"award-number":["I-1366-407.6\/2016"]}],"id":[{"id":"10.13039\/501100001736","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["308\/18"],"award-info":[{"award-number":["308\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["EFOP-3.6.2-16-2017-00015"],"award-info":[{"award-number":["EFOP-3.6.2-16-2017-00015"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"crossref","award":["SNN 129178"],"award-info":[{"award-number":["SNN 129178"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"crossref","award":["SNN 129364"],"award-info":[{"award-number":["SNN 129364"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"crossref","award":["EFOP-3.6.1-16-2016-00015"],"award-info":[{"award-number":["EFOP-3.6.1-16-2016-00015"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"crossref","award":["EFOP-3.6.2-16-2017-00015"],"award-info":[{"award-number":["EFOP-3.6.2-16-2017-00015"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00453-021-00818-7","type":"journal-article","created":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T09:05:01Z","timestamp":1615799101000},"page":"2047-2062","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["A New Lower Bound for Classic Online Bin Packing"],"prefix":"10.1007","volume":"83","author":[{"given":"J\u00e1nos","family":"Balogh","sequence":"first","affiliation":[]},{"given":"J\u00f3zsef","family":"B\u00e9k\u00e9si","sequence":"additional","affiliation":[]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6761-8521","authenticated-orcid":false,"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,15]]},"reference":[{"issue":"1\u20133","key":"818_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.dam.2003.05.006","volume":"143","author":"L Babel","year":"2004","unstructured":"Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Appl. Math. 143(1\u20133), 238\u2013251 (2004)","journal-title":"Discrete Appl. Math."},{"key":"818_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: Proc. of the 26th European Symposium on Algorithms (ESA2018), pp. 5:1\u20135:14 (2018)"},{"key":"818_CR3","doi-asserted-by":"crossref","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, Gy., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. In: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA2019), pp. 18\u201328 (2019)","DOI":"10.1007\/978-3-030-39479-0_2"},{"key":"818_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.jcss.2020.03.002","volume":"112","author":"Online bin packing with cardinality constraints resolved","year":"2020","unstructured":"Online bin packing with cardinality constraints resolved: J. Comput. Syst. Sci. 112, 34\u201349 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"818_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.disopt.2016.04.007","volume":"21","author":"J Balogh","year":"2016","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, Gy., Galambos, G., Tan, Z.: Lower bound for 3-batched bin packing. Discrete Optim. 21, 14\u201324 (2016)","journal-title":"Discrete Optim."},{"key":"818_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.017","volume":"440","author":"J Balogh","year":"2012","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theor. Comput. Sci. 440, 1\u201313 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"818_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.ic.2016.06.001","volume":"249","author":"J B\u00e9k\u00e9si","year":"2016","unstructured":"B\u00e9k\u00e9si, J., D\u00f3sa, Gy.: Bounds for online bin packing with cardinality constraints. Inf. Comput. 249, 190\u2013204 (2016)","journal-title":"Inf. Comput."},{"key":"818_CR8","unstructured":"Blitz, D.: Lower bounds on the asymptotic worst-case ratios of on-line bin packing algorithms. Technical Report 114682, University of Rotterdam, M.Sc. thesis (1996)"},{"key":"818_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":"818_CR10","doi-asserted-by":"crossref","unstructured":"Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.\u00a0J. (eds.) Online Algorithms: The State of the Art, pp. 147\u2013177 (1998)","DOI":"10.1007\/BFb0029568"},{"issue":"3","key":"818_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10951-018-0567-z","volume":"21","author":"L Epstein","year":"2018","unstructured":"Epstein, L.: A survey on makespan minimization in semi-online environments. J. Scheduling 21(3), 269\u2013284 (2018)","journal-title":"J. Scheduling"},{"issue":"1","key":"818_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10878-013-9679-8","volume":"29","author":"H Fujiwara","year":"2015","unstructured":"Fujiwara, H., Kobayashi, K.M.: Improved lower bounds for the online bin packing problem with cardinality constraints. J. Comb. Optim. 29(1), 67\u201387 (2015)","journal-title":"J. Comb. Optim."},{"key":"818_CR13","unstructured":"Heydrich, S., van Stee, R.: Beating the harmonic lower bound for online bin packing. In: Proc. of 43rd International Colloquium on Automata, Languages, and Programming (ICALP2016), pp. 41:1\u201341:14, (2016)"},{"key":"818_CR14","unstructured":"Johnson, D.S.: Near-optimal bin packing algorithms. PhD thesis, MIT, Cambridge, MA (1973)"},{"key":"818_CR15","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, 272\u2013314 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"818_CR16","doi-asserted-by":"publisher","first-page":"256","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, 256\u2013278 (1974)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"818_CR17","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":"2","key":"818_CR18","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."},{"key":"818_CR19","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, 305\u2013326 (1989)","journal-title":"J. Algorithms"},{"issue":"5","key":"818_CR20","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"},{"key":"818_CR21","unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ (1971)"},{"issue":"5","key":"818_CR22","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 online bin packing algorithms. Inf. Process. Lett. 43(5), 277\u2013284 (1992)","journal-title":"Inf. Process. Lett."},{"key":"818_CR23","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, 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-021-00818-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00818-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00818-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T09:07:32Z","timestamp":1624352852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00818-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,15]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["818"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00818-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,15]]},"assertion":[{"value":"7 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}