{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:26Z","timestamp":1725495746885},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677154"},{"type":"electronic","value":"9783540450221"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45022-x_25","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T18:57:25Z","timestamp":1194980245000},"page":"283-295","source":"Crossref","is-referenced-by-count":4,"title":["An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing"],"prefix":"10.1007","author":[{"given":"Steven S.","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,18]]},"reference":[{"key":"25_CR1","unstructured":"Brown, D.J. A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. R-864, Coordinated Sci. Lab., University of Illinois at Urbana-Champaign, 1979."},{"issue":"1","key":"25_CR2","first-page":"63","volume":"13","author":"R. Burkard","year":"1997","unstructured":"Burkard, R., AND Zhang, G. Bounded space on-line variable-sized bin packing. Acta Cybernetica 13,1 (1997), 63\u201376.","journal-title":"Acta Cybernetica"},{"key":"25_CR3","unstructured":"Coffman, E. G., Garey, M. R., AND Johnson, D.S. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems, D. Hochbuam, Ed. PWS Publishing Company, 1997, ch. 2."},{"issue":"8","key":"25_CR4","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF00289157","volume":"26","author":"J. Csirik","year":"1989","unstructured":"Csirik, J. An on-line algorithm for variable-sized bin packing. Acta Informatica 26,8 (1989), 697\u2013709.","journal-title":"Acta Informatica"},{"key":"25_CR5","series-title":"Lect Notes Comput Sci","volume-title":"On-Line Algorithms\u2014The State of the Art","author":"J. Csirik","year":"1998","unstructured":"Csirik, J., AND Woeginger, G. On-line packing and covering problems. In On-Line Algorithms\u2014The State of the Art, A. Fiat and G. Woeginger, Eds., Lecture Notes in Computer Science. Springer-Verlag, 1998, ch. 7."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Friesen, D. K., AND Langston, M. A. Variable sized bin packing. SIAM Journal on Computing 15 (1986), 222\u2013230.","DOI":"10.1137\/0215016"},{"key":"25_CR7","volume-title":"PhD thesis","author":"D.S. Johnson","year":"1973","unstructured":"Johnson, D.S.Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1973."},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S. Fast algorithms for bin packing. Journal Computer Systems Science 8 (1974), 272\u2013314.","journal-title":"Journal Computer Systems Science"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0203025","volume":"3","author":"D. S. Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J. D., Garey, M. R., andGraham, R. L.. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3 (1974), 256\u2013278.","journal-title":"SIAM Journal on Computing"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0166-218X(88)90089-3","volume":"22","author":"D. S. Johnson","year":"1989","unstructured":"Kinnersley, N., AND Langston, M. Online variable-sized bin packing. Discrete Applied Mathematics 22,2 (Feb1989), 143\u2013148.","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C. Lee","year":"1985","unstructured":"Lee, C., AND Lee, D. A simple on-line bin-packing algorithm. Journal of the ACM 32,3 (Jul1985), 562\u2013572.","journal-title":"Journal of the ACM"},{"key":"25_CR12","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 10 (1980), 76\u201379.","journal-title":"Information Processing Letters"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","volume":"10","author":"P. Ramanan","year":"1989","unstructured":"Ramanan, P., Brown, D., Lee, C., AND Lee, D. On-line bin packing in linear time. Journal of Algorithms 10,3 (Sep 1989), 305\u2013326.","journal-title":"Journal of Algorithms"},{"key":"25_CR14","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 Applied Mathematics 34 (1991), 203\u2013227.","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Van Vliet, A. An improved lower bound for online bin packing algorithms. Information Processing Letters 43,5 (Oct 1992), 277\u2013284.","DOI":"10.1016\/0020-0190(92)90223-I"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"Y. A. C.C","year":"1980","unstructured":"Yao, A. C.C. New algorithms for bin packing. Journal of the ACM 27 (1980), 207\u2013227.","journal-title":"Journal of the ACM"},{"issue":"2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02309343","volume":"56","author":"G. Zhang","year":"1996","unstructured":"Zhang, G. Worst-case analysis of the FFH algorithm for online variable-sized bin packing. Computing 56,2 (1996), 165\u2013172.","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45022-X_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:44:33Z","timestamp":1551066273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45022-X_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677154","9783540450221"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45022-x_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}