{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:09:57Z","timestamp":1725484197506},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438649"},{"type":"electronic","value":"9783540454656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_27","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T01:12:57Z","timestamp":1180228377000},"page":"306-317","source":"Crossref","is-referenced-by-count":1,"title":["New Bounds for Variable-Sized and Resource Augmented Online Bin Packing"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Seiden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"key":"27_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."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(92)90023-O","volume":"1","author":"B. Chandra","year":"1992","unstructured":"Chandra, B. Does randomization help in on-line bin packing? Information Processing Letters 43, 1 (Aug 1992), 15\u201319.","journal-title":"Information Processing Letters 43"},{"key":"27_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. Hochbaum, Ed. PWS Publishing Company, 1997, ch. 2."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF00289157","volume":"8","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 26"},{"key":"27_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":"27_CR6","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":"27_CR7","volume-title":"Tech. Rep. SEN-R0104","author":"L. Epstein","year":"2001","unstructured":"Epstein, L., Seiden, S. S., AND Van Stee, R. On the fractal beauty of bin-packing. Tech. Rep. SEN-R0104, CWI, Amsterdam, 2001."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(84)90010-3","volume":"18","author":"D. K. Friesen","year":"1984","unstructured":"Friesen, D. K., AND Langston, M. A. A storage-size selection problem. Information Processing Letters 18 (1984), 295\u2013296.","journal-title":"Information Processing Letters"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D. K. Friesen","year":"1986","unstructured":"Friesen, D. K., AND Langston, M. A. Variable sized bin packing. SIAM Journal on Computing 15 (1986), 222\u2013230.","journal-title":"SIAM Journal on Computing"},{"key":"27_CR10","series-title":"PhD thesis","volume-title":"Near-optimal bin packing algorithms","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":"27_CR11","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":"27_CR12","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"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Kinnersley, N., AND Langston, M. Online variable-sized bin packing. Discrete Applied Mathematics 22, 2 (Feb 1989), 143\u2013148.","DOI":"10.1016\/0166-218X(88)90089-3"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Lee, C., AND Lee, D. A simple on-line bin-packing algorithm. Journal of the ACM 32, 3 (Jul 1985), 562\u2013572.","DOI":"10.1145\/3828.3833"},{"key":"27_CR15","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":"27_CR16","doi-asserted-by":"crossref","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.","DOI":"10.1016\/0196-6774(89)90031-X"},{"key":"27_CR17","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":"27_CR18","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"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Seiden, S. S. On the online bin packing problem. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (Jul 2001), pp. 237\u2013249.","DOI":"10.1007\/3-540-48224-5_20"},{"key":"27_CR20","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":"27_CR21","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-45465-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T23:33:32Z","timestamp":1550360012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}