{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T15:17:00Z","timestamp":1770909420945,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422877","type":"print"},{"value":"9783540482246","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_20","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"237-248","source":"Crossref","is-referenced-by-count":8,"title":["On the Online Bin Packing Problem"],"prefix":"10.1007","author":[{"given":"Steven S.","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"20_CR1","volume-title":"A lower bound for on-line one-dimensional bin packing algorithms","author":"D. J. Brown","year":"1979","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."},{"key":"20_CR2","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":"20_CR3","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":"20_CR4","series-title":"Lect Notes Comput Sci","volume-title":"On-Line Algorithms\u2014The State of the Art","author":"J. a. 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":"20_CR5","doi-asserted-by":"crossref","unstructured":"Csirik, J., AND Woeginger, G. Resource augmentation for online bounded space bin packing. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (Jul 2000), pp. 296\u2013304.","DOI":"10.1007\/3-540-45022-X_26"},{"key":"20_CR6","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":"20_CR7","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., AND Graham, 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"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C. a. Lee","year":"1985","unstructured":"Lee, C., AND Lee, D. A simple on-line bin-packing algorithm. Journal of the ACM 32, 3 (Jul 1985), 562\u2013572.","journal-title":"Journal of the ACM"},{"key":"20_CR9","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"},{"issue":"3","key":"20_CR10","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":"20_CR11","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 harmoic-based bin packing algorithms. Discrete Applied Mathematics 34 (1991), 203\u2013227.","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Seiden, S. S. An optimal online algorithm for bounded space variable-sized bin packing. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (Jul 2000), pp. 283\u2013295.","DOI":"10.1007\/3-540-45022-X_25"},{"issue":"5","key":"20_CR13","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 online bin packing algorithms. Information Processing Letters 43, 5 (Oct 1992), 277\u2013284.","journal-title":"Information Processing Letters"},{"key":"20_CR14","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 27 (1980), 207\u2013227.","journal-title":"Journal of the ACM"}],"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-48224-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T14:05:41Z","timestamp":1551017141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}