{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T17:04:46Z","timestamp":1777827886611,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:00:00Z","timestamp":1505347200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10878-017-0175-4","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T11:21:06Z","timestamp":1505388066000},"page":"350-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tight bounds for NF-based bounded-space online bin packing algorithms"],"prefix":"10.1007","volume":"35","author":[{"given":"J\u00f3zsef","family":"B\u00e9k\u00e9si","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Galambos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,14]]},"reference":[{"key":"175_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.017","volume":"440\u2013441","author":"J Balogh","year":"2012","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G (2012) New lower bounds for certain classes of bin packing algorithms. Theor Comput Sci 440\u2013441:1\u201313","journal-title":"Theor Comput Sci"},{"issue":"1","key":"175_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10878-012-9489-4","volume":"27","author":"J Balogh","year":"2014","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G, Reinelt G (2014) Online bin packing with restricted repacking. J Comb Optim 27(1):115\u2013131","journal-title":"J Comb Optim"},{"key":"175_CR3","doi-asserted-by":"crossref","first-page":"2785","DOI":"10.1016\/j.dam.2009.03.015","volume":"157","author":"L Epstein","year":"2009","unstructured":"Epstein L, Kleiman E (2009) Resource augmented semi-online bounded space bin packing. Discrete Appl Math 157:2785\u20132798","journal-title":"Discrete Appl Math"},{"key":"175_CR4","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1137\/0607041","volume":"7","author":"G Galambos","year":"1986","unstructured":"Galambos G (1986) Parametric lower bound for online bin packing. SIAM J Algebr Discrete Methods 7:362\u2013367","journal-title":"SIAM J Algebr Discrete Methods"},{"key":"175_CR5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02248693","volume":"49","author":"G Galambos","year":"1993","unstructured":"Galambos G, Woeginger GJ (1993) Repacking helps in bounded space online bin packing. Computing 49:329\u2013338","journal-title":"Computing"},{"key":"175_CR6","unstructured":"Grove EF (1995) Online bin packing with lookahead. In: Proceedings of the sixth annual ACM-SIAM Symposium on Discrete Algorithms, pp 430\u2013436"},{"issue":"1","key":"175_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.disopt.2004.11.001","volume":"2","author":"G Gutin","year":"2005","unstructured":"Gutin G, Jensen T, Yeo A (2005) Batched bin packing. Discrete Optim 2(1):71\u201382","journal-title":"Discrete Optim"},{"key":"175_CR8","unstructured":"Heydrich S, van Stee R (2016) Beating the harmonic lower bound for online bin packing. In: Rabani Y, Chatzigiannakis I, Mitzenmacher M, Sangiorgi D (eds) ICALP 2016, Leibniz international proceedings in informatics, vol 55, pp 41:1\u201341:14"},{"key":"175_CR9","unstructured":"Johnson DS (1973) Near-optimal bin-packing algorithms. Doctoral Thesis, MIT, Cambridge"},{"key":"175_CR10","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S Seiden","year":"2002","unstructured":"Seiden S (2002) On the online bin packing problem. J ACM 49:640\u2013671","journal-title":"J ACM"},{"key":"175_CR11","doi-asserted-by":"crossref","first-page":"332","DOI":"10.2307\/2369261","volume":"3","author":"J Sylvester","year":"1880","unstructured":"Sylvester J (1880) On a point in the theory of vulgar fractions. Am J Math 3:332\u2013335","journal-title":"Am J Math"},{"key":"175_CR12","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A Vliet van","year":"1992","unstructured":"van Vliet A (1992) An improved lower bound for online bin packing algorithms. Inf Proc Lett 43:274\u2013284","journal-title":"Inf Proc Lett"},{"issue":"2","key":"175_CR13","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/s10878-015-9976-5","volume":"33","author":"M Zhang","year":"2017","unstructured":"Zhang M, Han X, Lan Y, Ting H-F (2017) Online bin packing problem with buffer and bounded size revisited. J Comb Optim 33(2):530\u2013542","journal-title":"J Comb Optim"},{"issue":"2","key":"175_CR14","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/s10878-014-9771-8","volume":"30","author":"F Zheng","year":"2015","unstructured":"Zheng F, Huo L, Zhang E (2015) NF-based algorithms for online bin packing with buffer and bounded item size. J Comb Optim 30(2):360\u2013369","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0175-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0175-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0175-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T12:38:10Z","timestamp":1518179890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0175-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,14]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0175-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,14]]}}}