{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:18:50Z","timestamp":1755998330529},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183171"},{"type":"electronic","value":"9783642183188"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18318-8_3","type":"book-chapter","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T08:58:06Z","timestamp":1295859486000},"page":"25-36","source":"Crossref","is-referenced-by-count":15,"title":["New Lower Bounds for Certain Classes of Bin Packing Algorithms"],"prefix":"10.1007","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":"G\u00e1bor","family":"Galambos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Csirik, J., Galambos, G., Tur\u00e1n, G.: Some Results on Bin Packing. In: Proceedings of EURO VI., Vienna (1983)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Galambos, G.: Parametric Lower Bound for On-line Bin Packing. SIAM J. Algebraic Discrete Methods, 362\u2013367 (1986)","DOI":"10.1137\/0607041"},{"key":"3_CR3","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 Cybernetica\u00a010, 21\u201324 (1991)","journal-title":"Acta Cybernetica"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0166-218X(93)90037-O","volume":"41","author":"G. Galambos","year":"1993","unstructured":"Galambos, G., Frenk, J.B.G.: A Simple Proof of Liang\u2019s Lower Bound for On-line Bin Packing and Extension to the Parametric Case. Discrete Applied Mathematics\u00a041, 173\u2013178 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR5","first-page":"23","volume":"11","author":"G. Galambos","year":"1993","unstructured":"Galambos, G., Kellerer, H., Woeginger, G.: A Lower Bound for On-line Vector-packing Algorithms. Acta Cybernetica\u00a011, 23\u201334 (1993)","journal-title":"Acta Cybernetica"},{"key":"3_CR6","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\u00a052, 281\u2013297 (1994)","journal-title":"Computing"},{"key":"3_CR7","volume-title":"Computer and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Fast Approximation Algorithms for Bin Packing. J. Comput. Syst. Sci.\u00a08, 272\u2013314 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0020-0190(80)90077-0","volume":"10","author":"F.M. Liang","year":"1980","unstructured":"Liang, F.M.: A Lower Bound for On-line Bin Packing. Inf. Proc. Letters\u00a010, 76\u201379 (1980)","journal-title":"Inf. Proc. Letters"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S. Seiden","year":"2002","unstructured":"Seiden, S.: On the On-line Bin Packing Problem. Journal of ACM\u00a049, 640\u2013671 (2002)","journal-title":"Journal of ACM"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/S0097539702412908","volume":"32","author":"S. Seiden","year":"2003","unstructured":"Seiden, S., van Stee, R., Epstein, L.: New Bounds for Variable-sized Online Bin Packing. SIAM J. on Computing\u00a032, 455\u2013469 (2003)","journal-title":"SIAM J. on Computing"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"332","DOI":"10.2307\/2369261","volume":"3","author":"J. Sylvester","year":"1880","unstructured":"Sylvester, J.: On a Point in the Theory of Vulgar Fractions. American Journal of Mathematics\u00a03, 332\u2013335 (1880)","journal-title":"American Journal of Mathematics"},{"key":"3_CR13","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.: An Improved Lower Bound for On-line Bin Packing Algorithms. Inf. Proc. Letters\u00a043, 274\u2013284 (1992)","journal-title":"Inf. Proc. Letters"},{"key":"3_CR14","unstructured":"van Vliet, A.: Lower Bound and Upper Bounds for On-line Bin Packing and Scheduling Algorithms, PhD Thesis, Tinbergen Institute Research Series no. 93"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18318-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T02:56:31Z","timestamp":1559962591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18318-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183171","9783642183188"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18318-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}