{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:42:57Z","timestamp":1725453777932},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_45","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"506-517","source":"Crossref","is-referenced-by-count":0,"title":["Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing"],"prefix":"10.1007","author":[{"given":"Yong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yung H.","family":"Tsin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Blitz, D., van Vliet, A., Woeginger, G.J.: Lower bounds on the asymptotic worst-case ratio of on-line bin packing algorithms (1996) (unpublished manuscript)","DOI":"10.1006\/jagm.1996.0005"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00453-001-0041-7","volume":"31","author":"J. Csirik","year":"2001","unstructured":"Csirik, J., Johnson, D.S.: Bounded Space On-Line Bin Packing: Best is Better than First. Algorithmica\u00a031, 115\u2013138 (2001)","journal-title":"Algorithmica"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-10631-6_34","volume-title":"Algorithms and Computation","author":"F.Y.L. Chin","year":"2009","unstructured":"Chin, F.Y.L., Ting, H.-F., Zhang, Y.: 1-Bounded Space Algorithms for 2-Dimensional Bin Packing. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 321\u2013330. Springer, Heidelberg (2009)"},{"issue":"2","key":"45_CR4","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0097539705446895","volume":"35","author":"L. Epstein","year":"2005","unstructured":"Epstein, L., van Stee, R.: Optimal Online Algorithms for Multidimensional Packing Problems. SIAM Jouranl on Computing\u00a035(2), 431\u2013448 (2005)","journal-title":"SIAM Jouranl on Computing"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0020-0190(02)00373-3","volume":"85","author":"S. Fujita","year":"2003","unstructured":"Fujita, S.: On-Line Grid-Packing with a Single Active Grid. Information Processing Letters\u00a085, 199\u2013204 (2003)","journal-title":"Information Processing Letters"},{"issue":"4","key":"45_CR6","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2000807.2000818","volume":"7","author":"X. Han","year":"2011","unstructured":"Han, X., Chin, F.Y.L., Ting, H.F., Zhang, G., Zhang, Y.: A New Upper Bound on 2D Online Bin Packing. ACM Transactions on Algorithms\u00a07(4), 50 (2011)","journal-title":"ACM Transactions on Algorithms"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1004953109743","volume":"67","author":"J. Januszewski","year":"1997","unstructured":"Januszewski, J., Lassak, M.: On-line packing sequences of cubes in the unit cube. Geometriae Dedicata\u00a067, 285\u2013293 (1997)","journal-title":"Geometriae Dedicata"},{"issue":"4","key":"45_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A.J., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-Case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing\u00a03(4), 299\u2013325 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR9","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 algorithm. J. Assoc. Comput. Mach.\u00a032, 562\u2013572 (1985)","journal-title":"J. Assoc. Comput. Mach."},{"key":"45_CR10","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":"45_CR11","unstructured":"Seiden, S., van Stee, R.: New bounds for multi-dimensional packing. In: Proc. of SODA, pp. 486\u2013495 (2002)"},{"key":"45_CR12","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. Information Processing Letters\u00a043, 277\u2013284 (1992)","journal-title":"Information Processing Letters"},{"key":"45_CR13","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. Journal of the ACM\u00a027, 207\u2013227 (1980)","journal-title":"Journal of the ACM"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-17514-5_21","volume-title":"Algorithms and Computation","author":"Y. Zhang","year":"2010","unstructured":"Zhang, Y., Chen, J., Chin, F.Y.L., Han, X., Ting, H.-F., Tsin, Y.H.: Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol.\u00a06507, pp. 242\u2013253. Springer, Heidelberg (2010)"},{"key":"45_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-21204-8_33","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Y. Zhang","year":"2011","unstructured":"Zhang, Y., Chin, F.Y.L., Ting, H.-F., Han, X., Chang, Z.: Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol.\u00a06681, pp. 308\u2013318. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T02:04:33Z","timestamp":1557713073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}