{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:14:11Z","timestamp":1765887251701,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_21","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"242-253","source":"Crossref","is-referenced-by-count":12,"title":["Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing"],"prefix":"10.1007","author":[{"given":"Yong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingchi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yung H.","family":"Tsin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","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.R., Kenyon, C., Sviridenko, M.: Bin Packing in Multiple Dimensions: In-approximability Results and Approximation Schemes. Mathematics of Operations Research\u00a031(1), 31\u201349 (2006)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Caprara, A., Sviridenko, M.: Improved approximation algorithm for multidimensional bin packing problems. In: FOCS 2006, pp. 697\u2013708 (2006)","DOI":"10.1109\/FOCS.2006.38"},{"key":"21_CR3","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":"21_CR4","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Packing 2-dimensional bins in harmony. In: FOCS 2002, pp. 490\u2013499 (2002)","DOI":"10.1109\/SFCS.2002.1181973"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/0603007","volume":"3","author":"F.R.K. Chung","year":"1982","unstructured":"Chung, F.R.K., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods\u00a03(1), 66\u201376 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"21_CR6","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":"21_CR7","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-Space Bounded 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":"21_CR8","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"},{"issue":"9","key":"21_CR9","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 Inf.\u00a041(9), 595\u2013606 (2005)","journal-title":"Acta Inf."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.disopt.2006.11.005","volume":"4","author":"L. Epstein","year":"2007","unstructured":"Epstein, L., van Stee, R.: Bounds for online bounded space hypercube packing. Discrete Optimization\u00a04, 185\u2013197 (2007)","journal-title":"Discrete Optimization"},{"key":"21_CR11","first-page":"223","volume":"19","author":"C.E. Ferreira","year":"1999","unstructured":"Ferreira, C.E., Miyazawa, E.K., Wakabayashi, Y.: Packing squares into squares. Pesquisa Operacional\u00a019, 223\u2013237 (1999)","journal-title":"Pesquisa Operacional"},{"key":"21_CR12","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"},{"key":"21_CR13","unstructured":"Han, X., Chin, F., Ting, H.-F., Zhang, G., Zhang, Y.: A New Upper Bound on 2D Online Bin Packing (manuscript)"},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00224-007-9039-0","volume":"43","author":"X. Han","year":"2008","unstructured":"Han, X., Iwama, K., Zhang, G.: Online removable square packing. Theory of Computing Systems\u00a043(1), 38\u201355 (2008)","journal-title":"Theory of Computing Systems"},{"key":"21_CR15","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":"21_CR16","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":"21_CR17","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":"21_CR18","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"J.Y.-T. Leung","year":"1990","unstructured":"Leung, J.Y.-T., Tam, T.W., Wong, C.S., Young, G.H., Chin, F.Y.L.: Packing squares into a square. J. Parallel Distrib. Comput.\u00a010, 271\u2013275 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"21_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-004-1102-5","volume":"40","author":"Y. Kohayakawa","year":"2004","unstructured":"Kohayakawa, Y., Miyazawa, F.K., Raghavan, P., Wakabayashi, Y.: Multidimensionalcube packing. Algorithmica\u00a040(3), 173\u2013187 (2004)","journal-title":"Algorithmica"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S0021-9800(68)80047-X","volume":"5","author":"A. Meir","year":"1968","unstructured":"Meir, A., Moser, L.: On packing of squares and cubes. Journal of Combinatorial Theory\u00a05, 126\u2013134 (1968)","journal-title":"Journal of Combinatorial Theory"},{"key":"21_CR21","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. Journal of Algorithms\u00a010, 305\u2013326 (1989)","journal-title":"Journal of Algorithms"},{"key":"21_CR22","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":"21_CR23","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":"21_CR24","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"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T12:13:23Z","timestamp":1740744803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}