{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:35:37Z","timestamp":1725478537984},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695134"},{"type":"electronic","value":"9783540695141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/11970125_18","type":"book-chapter","created":{"date-parts":[[2007,1,24]],"date-time":"2007-01-24T05:47:40Z","timestamp":1169617660000},"page":"226-239","source":"Crossref","is-referenced-by-count":2,"title":["Improved Online Hypercube Packing"],"prefix":"10.1007","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Brown, D.J.: A lower bound for on-line one-dimensional bin packing algorithms, Techincal report R864, Coordinated Sci. Lab., Urbana, Illinois (1979)"},{"key":"18_CR2","volume-title":"Approximation Algorithms for NP-hard Problems, ch. 2","author":"E.G. Coffman","year":"1997","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems. ch. 2. PWS, Boston (1997)"},{"key":"18_CR3","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., Paghavan, P.: Multidimensional on-line bin packing: Algorithms and worst case analysis. Oper. Res. Lett.\u00a08, 17\u201320 (1989)","journal-title":"Oper. Res. Lett."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(93)90004-Z","volume":"13","author":"J. Csirik","year":"1993","unstructured":"Csirik, J., van Vliet, A.: An on-line algorithm for multidimensional bin packing. Oper. Res. Lett.\u00a013, 149\u2013158 (1993)","journal-title":"Oper. Res. Lett."},{"key":"18_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":"18_CR6","doi-asserted-by":"crossref","unstructured":"Epstein, L., van Stee, R.: Optimal online bounded space multidimensional packing. In: SODA 2004, pp. 214\u2013223 (2004)","DOI":"10.1007\/978-3-540-30140-0_27"},{"issue":"2","key":"18_CR7","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 J. Computing\u00a035(2), 431\u2013448 (2005)","journal-title":"SIAM J. Computing"},{"issue":"9","key":"18_CR8","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."},{"issue":"4","key":"18_CR9","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 J. Comput.\u00a03(4), 299\u2013325 (1974)","journal-title":"SIAM J. Comput."},{"key":"18_CR10","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 online bin packing. Information processing letters\u00a010, 76\u201379 (1980)","journal-title":"Information processing letters"},{"key":"18_CR11","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"},{"issue":"297","key":"18_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0304-3975(02)00647-3","volume":"1-3","author":"F.K. Miyazawa","year":"2003","unstructured":"Miyazawa, F.K., Wakabayashi, Y.: Cube packing. Theor. Comput. Sci.\u00a01-3(297), 355\u2013366 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR13","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":"18_CR14","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"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"S.S. Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R.: New bounds for multidimensional packing. Algorithmica\u00a036(3), 261\u2013293 (2003)","journal-title":"Algorithmica"},{"key":"18_CR16","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":"18_CR17","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"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11970125_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:23:49Z","timestamp":1619508229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11970125_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695134","9783540695141"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11970125_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}