{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:37:27Z","timestamp":1775054247373,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540728689","type":"print"},{"value":"9783540728702","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72870-2_34","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:53:10Z","timestamp":1182775990000},"page":"358-367","source":"Crossref","is-referenced-by-count":12,"title":["Strip Packing vs. Bin Packing"],"prefix":"10.1007","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0196-6774(85)90018-5","volume":"6","author":"B.S. Baker","year":"1985","unstructured":"Baker, B.S.: A new proof for the first-fit decreasing bin-packing algorithm. J. Algorithms\u00a06, 49\u201370 (1985)","journal-title":"J. Algorithms"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0196-6774(81)90034-1","volume":"2","author":"B.S. Baker","year":"1981","unstructured":"Baker, B.S., Brown, D.J., Katseff, H.P.: A 5\/4 algorithm for two-dimensional packing. J. Algorithms\u00a02, 348\u2013368 (1981)","journal-title":"J. Algorithms"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1137\/0212033","volume":"12","author":"B.S. Baker","year":"1983","unstructured":"Baker, B.S., Schwarz, J.S.: Shelf algorithms for two-dimensional packing problems. SIAM J. Comput.\u00a012, 508\u2013525 (1983)","journal-title":"SIAM J. Comput."},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman","year":"1980","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level oriented two dimensional packing algorithms. SIAM J. Comput.\u00a09, 808\u2013826 (1980)","journal-title":"SIAM J. Comput."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0020-0190(97)00120-8","volume":"63","author":"J. Csirik","year":"1997","unstructured":"Csirik, J., Woeginger, G.J.: Shelf algorithm for on-line strip packing. Information Processing Letters\u00a063, 171\u2013175 (1997)","journal-title":"Information Processing Letters"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/0210042","volume":"10","author":"I. Golan","year":"1981","unstructured":"Golan, I.: Performance bounds for orthogonal, oriented two-dimensional packing algorithms. SIAM J. Comput.\u00a010, 571\u2013582 (1981)","journal-title":"SIAM J. Comput."},{"key":"34_CR7","unstructured":"Johnson, D.S.: Near-optimal bin-packing algorithms Doctoral thesis, M.I.T., Cambridge, Mass. (1973)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proc. 23rd Annual IEEE Symp. Found. Comput. Sci., pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C. Kenyon","year":"2000","unstructured":"Kenyon, C., R\u00e9mila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research\u00a025, 645\u2013656 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C.C. Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorihtm. J. ACM\u00a032, 562\u2013572 (1985)","journal-title":"J. ACM"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","volume":"10","author":"P.V. Ramanan","year":"1989","unstructured":"Ramanan, P.V., Brown, D.J., Lee, C.C., Lee, D.T.: On-line bin packing in linear Time. J. Algorithms\u00a010, 305\u2013326 (1989)","journal-title":"J. Algorithms"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(91)90087-D","volume":"34","author":"M.B. Richey","year":"1991","unstructured":"Richey, M.B.: Improved bounds for harmonic-based bin packing algorithms. Discrete Appl. Math.\u00a034, 203\u2013227 (1991)","journal-title":"Discrete Appl. Math."},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S.S. Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. ACM\u00a049, 640\u2013671 (2002)","journal-title":"J. ACM"},{"key":"34_CR14","unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Tech. Rep. 100, Princeton University, Princeton, N.J. (Oct. 1971)"},{"key":"34_CR15","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 on-line bin packing algorithms. Inform. Process. Lett.\u00a043, 277\u2013284 (1992)","journal-title":"Inform. Process. Lett."},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"A.C.-C. Yao","year":"1980","unstructured":"Yao, A.C.-C.: New Algorithms for Bin Packing. J. ACM\u00a027, 207\u2013227 (1980)","journal-title":"J. ACM"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02009683","volume":"7","author":"M. Yue","year":"1991","unstructured":"Yue, M.: A simple proof of the inequality FFD(L) \u2264 11\/9OPT(L) +1, \u2200\u2009L for the FFD bin-packing algorithm. Acta mathematicae applicatae sinica\u00a07, 321\u2013331 (1991)","journal-title":"Acta mathematicae applicatae sinica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72870-2_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:07:19Z","timestamp":1605762439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72870-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728689","9783540728702"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72870-2_34","relation":{},"subject":[]}}