{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T15:47:30Z","timestamp":1771861650664,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T00:00:00Z","timestamp":1552089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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"}]},{"name":"EU-funded Hungarian grant","award":["EFOP-3.6.3-VEKOP-16-2017-0002"],"award-info":[{"award-number":["EFOP-3.6.3-VEKOP-16-2017-0002"]}]},{"name":"EU-funded Hungarian grant","award":["EFOP-3.6.2-16-2017-00015"],"award-info":[{"award-number":["EFOP-3.6.2-16-2017-00015"]}]},{"name":"Szechenyi","award":["EFOP-3.6.1-16-2016-00015"],"award-info":[{"award-number":["EFOP-3.6.1-16-2016-00015"]}]},{"DOI":"10.13039\/501100011019","name":"NKFIH","doi-asserted-by":"crossref","award":["SNN 116095"],"award-info":[{"award-number":["SNN 116095"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00224-019-09915-1","type":"journal-article","created":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T01:52:17Z","timestamp":1552096337000},"page":"1757-1780","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Lower Bounds for Several Online Variants of Bin Packing"],"prefix":"10.1007","volume":"63","author":[{"given":"J\u00e1nos","family":"Balogh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f3zsef","family":"B\u00e9k\u00e9si","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,9]]},"reference":[{"key":"9915_CR1","first-page":"40","volume-title":"Lecture Notes in Computer Science","author":"Spyros Angelopoulos","year":"2015","unstructured":"Angelopoulos, S., Du\u0307rr, C., Kamali, S., Renault, M.P., Ros\u0117n, A.: Online bin packing with advice of small size. In: Proceedings of The 14th International Symposium Algorithms and Data Structures (WADS\u201915), pp. 40\u201353 (2015)"},{"issue":"1-3","key":"9915_CR2","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. Discret. Appl. Math. 143(1-3), 238\u2013251 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"9915_CR3","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s10100-012-0266-3","volume":"21","author":"J Balogh","year":"2013","unstructured":"Balogh, J., B\u00e9k\u00e9si, J.: Semi-on-line bin packing: a short overview and a new lower bound. CEJOR 21(4), 685\u2013698 (2013)","journal-title":"CEJOR"},{"key":"9915_CR4","doi-asserted-by":"crossref","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, Gy., Epstein, L., Levin, A.: Online bin packing with cardinality constraints resolved. The Computing Res. Rep. (CoRR), arXiv:\n                    1608.06415\n                    \n                   (2016)","DOI":"10.1016\/j.ic.2016.06.001"},{"key":"9915_CR5","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, Gy., Epstein, L., Levin, A.: Online bin packing with cardinality constraints resolved. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA\u201917), pp. 10:1\u201310:14 (2017)"},{"key":"9915_CR6","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 annual European symposium on algorithms (ESA18), pp 5:1\u20135:14 (2018)"},{"key":"9915_CR7","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, Gy., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. The Computing Res. Rep. (CoRR), arXiv:\n                    1807.05554\n                    \n                   (2018)"},{"key":"9915_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.017","volume":"440-441","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-441, 1\u201313 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9915_CR9","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., 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":"9915_CR10","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., Epstein, L.: Bounds for online bin packing with cardinality constraints. Inf. Comput. 249, 190\u2013204 (2016)","journal-title":"Inf. Comput."},{"key":"9915_CR11","unstructured":"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)"},{"issue":"1","key":"9915_CR12","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00453-014-9955-8","volume":"74","author":"J Boyar","year":"2016","unstructured":"Boyar, J., Kamali, S., Larsen, K.S., L\u00f3pez-Ortiz, A.: Online bin packing with advice. Algorithmica 74(1), 507\u2013527 (2016)","journal-title":"Algorithmica"},{"issue":"1","key":"9915_CR13","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(1), 17\u201320 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"9915_CR14","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1137\/050639065","volume":"20","author":"L Epstein","year":"2006","unstructured":"Epstein, L.: Online bin packing with cardinality constraints. SIAM J. Discret. Math. 20(4), 1015\u20131030 (2006)","journal-title":"SIAM J. Discret. Math."},{"issue":"34-36","key":"9915_CR15","doi-asserted-by":"publisher","first-page":"3073","DOI":"10.1016\/j.tcs.2010.04.037","volume":"411","author":"L Epstein","year":"2010","unstructured":"Epstein, L., Imreh, Cs., Levin, A.: Class constrained bin packing revisited. Theor. Comput. Sci. 411(34-36), 3073\u20133089 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9915_CR16","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1137\/060666329","volume":"19","author":"L Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: On bin packing with conflicts. SIAM J. Optim. 19 (3), 1270\u20131298 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9915_CR17","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1137\/11082782X","volume":"23","author":"L Epstein","year":"2013","unstructured":"Epstein, L., Levin, A.: Robust approximation schemes for cube packing. SIAM J. Optim. 23(2), 1310\u20131343 (2013)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"9915_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 Informatica 41(9), 595\u2013606 (2005)","journal-title":"Acta Informatica"},{"key":"9915_CR19","unstructured":"Epstein, L., Tushia, A.: Work in progress (2018)"},{"issue":"1","key":"9915_CR20","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.: 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."},{"issue":"2","key":"9915_CR21","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":"9915_CR22","doi-asserted-by":"crossref","unstructured":"Heydrich, S., van Stee, R.: Improved Lower Bounds for Online Hypercube Packing. The Computing Res. Rep. (CoRR), arXiv:\n                    1607.01229\n                    \n                   (2016)","DOI":"10.1007\/978-1-4939-2864-4_493"},{"key":"9915_CR23","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":"9915_CR24","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."},{"key":"9915_CR25","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1018947117526","volume":"92","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H., Pferschy, U.: Cardinality constrained bin-packing problems. Ann. Oper. Res. 92, 335\u2013348 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9915_CR26","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/321906.321917","volume":"22","author":"KL Krause","year":"1975","unstructured":"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\u2013550 (1975)","journal-title":"J. ACM"},{"issue":"2","key":"9915_CR27","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":"5","key":"9915_CR28","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":"9915_CR29","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 multi-dimensional packing. Algorithmica 36(3), 261\u2013293 (2003)","journal-title":"Algorithmica"},{"issue":"1","key":"9915_CR30","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2003.05.006","volume":"321","author":"H Shachnai","year":"2004","unstructured":"Shachnai, H., Tamir, T.: Tight bounds for online class-constrained packing. Theor. Comput. Sci. 321(1), 103\u2013123 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9915_CR31","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jos.86","volume":"4","author":"H Shachnai","year":"2001","unstructured":"Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. J. Sched. 4(6), 313\u2013338 (2001)","journal-title":"J. Sched."},{"key":"9915_CR32","volume-title":"The Performance of a Memory Allocation Algorithm. Technical Report, vol. 100","author":"JD Ullman","year":"1971","unstructured":"Ullman, J.D.: The Performance of a Memory Allocation Algorithm. Technical Report, vol. 100. Princeton University, Princeton (1971)"},{"issue":"5","key":"9915_CR33","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A Vliet van","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."},{"issue":"1-3","key":"9915_CR34","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.tcs.2008.01.001","volume":"393","author":"EC Xavier","year":"2008","unstructured":"Xavier, E.C., Miyazawa, F.K.: The class constrained bin packing problem with applications to video-on-demand. Theor. Comput. Sci. 393(1-3), 240\u2013259 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"9915_CR35","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":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09915-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-019-09915-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09915-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,8]],"date-time":"2020-03-08T00:09:34Z","timestamp":1583626174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-019-09915-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,9]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["9915"],"URL":"https:\/\/doi.org\/10.1007\/s00224-019-09915-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,9]]},"assertion":[{"value":"9 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}