{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T05:30:46Z","timestamp":1741239046823,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"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-21204-8_33","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"308-318","source":"Crossref","is-referenced-by-count":2,"title":["Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing"],"prefix":"10.1007","author":[{"given":"Yong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[]},{"given":"Zhuo","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"33_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":"33_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":"33_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":"33_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":"33_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":"33_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0167-6377(89)90027-8","volume":"8","author":"D. Coppersmith","year":"1989","unstructured":"Coppersmith, D., Raghavan, P.: Multidimensional on-line bin packing: Algorithms and worst case analysis. Oper. Res. Lett.\u00a08, 17\u201320 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"33_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(93)90009-D","volume":"45","author":"J. Csirik","year":"1993","unstructured":"Csirik, J., Frenk, J., Labbe, M.: Two-dimensional rectangle packing: on-line methods and results. Discrete Applied Mathematics\u00a045(3), 197\u2013204 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"33_CR8","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":"33_CR9","unstructured":"Chin, F.Y.L., Ting, H.-F., Zhang, Y.: 1-Space Bounded Algorithms for 2-Dimensional Bin Packing. To appear in International Journal of Foundation of Computer Science"},{"key":"33_CR10","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)"},{"issue":"2","key":"33_CR11","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":"33_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":"33_CR13","volume-title":"Computers and Intractability: A Guide for the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide for the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"33_CR14","first-page":"43","volume":"93","author":"X. Han","year":"2001","unstructured":"Han, X., Fujita, S., Guo, H.: Dimensional Harmonic Algorithm with Performance Ratio 2.7834. IPSJ SIG. Notes\u00a0(93), 43\u201350 (2001)","journal-title":"IPSJ SIG. Notes"},{"key":"33_CR15","unstructured":"Han, X., Chin, F., Ting, H.-F., Zhang, G., Zhang, Y.: A New Upper Bound on 2D Online Bin Packing (manuscript)"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0885-064X(85)90022-6","volume":"1","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S., Garey, M.R.: A 71\/60 theorem for bin-packing. J. Complexity\u00a01, 65\u2013106 (1985)","journal-title":"J. Complexity"},{"issue":"4","key":"33_CR17","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":"33_CR18","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":"33_CR19","first-page":"312","volume-title":"Proc. 23rd Ann. IEEE Symp. on Foundations of Comput. Sci.","author":"N. Karmarkar","year":"1982","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin packing problem. In: Proc. 23rd Ann. IEEE Symp. on Foundations of Comput. Sci., pp. 312\u2013320. IEEE Computer Society, Los Alamitos (1982)"},{"key":"33_CR20","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":"33_CR21","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":"33_CR22","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Res. Logistics\u00a041, 579\u2013585 (1994)","journal-title":"Naval Res. Logistics"},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"S. Seiden","year":"2003","unstructured":"Seiden, S., van Stee, R.: New bounds for multi-dimensional packing. Algorithmica\u00a036, 261\u2013293 (2003)","journal-title":"Algorithmica"},{"key":"33_CR24","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":"33_CR25","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","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T21:54:44Z","timestamp":1741211684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}