{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:08Z","timestamp":1725566288957},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_27","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"287-298","source":"Crossref","is-referenced-by-count":6,"title":["On Variable-Sized Multidimensional Packing"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Blitz, D., van Vliet, A., Woeginger, G.J.: Lower bounds on the asymptotic worst-case ratio of online bin packing algorithms (1996) (unpublished manuscript)"},{"key":"27_CR2","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 online bin packing:Algorithms and worst case analysis. Operations Research Letters\u00a08, 17\u201320 (1989)","journal-title":"Operations Research Letters"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF00289157","volume":"26","author":"J. Csirik","year":"1989","unstructured":"Csirik, J.: An online algorithm for variable-sized bin packing. Acta Informatica\u00a026, 697\u2013709 (1989)","journal-title":"Acta Informatica"},{"key":"27_CR4","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.B.G., Labbe, M.: Two dimensional rectangle packing: on line methods and results. Discrete Applied Mathematics\u00a045, 197\u2013204 (1993)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"27_CR5","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. Operations Research Letters\u00a013(3), 149\u2013158 (1993)","journal-title":"Operations Research Letters"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Csirik, J., Woeginger, G.J.: Resource augmentation for online bounded space bin packing. In: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, July 2000, pp. 296\u2013304 (2000)","DOI":"10.1007\/3-540-45022-X_26"},{"key":"27_CR7","unstructured":"Epstein, L., van Stee, R.: Optimal online bounded space multidimensional packing. In: Proc. of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 207\u2013216. ACM\/SIAM (2004)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D.K. Friesen","year":"1986","unstructured":"Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM Journal on Computing\u00a015, 222\u2013230 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR9","first-page":"21","volume":"10","author":"G. Galambos","year":"1991","unstructured":"Galambos, G.: A 1.6 lower bound for the two-dimensional online rectangle bin packing. Acta Cybernetica\u00a010, 21\u201324 (1991)","journal-title":"Acta Cybernetica"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02246509","volume":"52","author":"G. Galambos","year":"1994","unstructured":"Galambos, G., van Vliet, A.: Lower bounds for 1-, 2-, and 3-dimensional online bin packing algorithms. Computing\u00a052, 281\u2013297 (1994)","journal-title":"Computing"},{"key":"27_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 online bin packing algorithm. Journal of the ACM\u00a032, 562\u2013572 (1985)","journal-title":"Journal of the ACM"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1142\/S0129054190000114","volume":"1","author":"K. Li","year":"1990","unstructured":"Li, K., Cheng, K.H.: Generalized First-Fit algorithms in two and three dimensions. International Journal on Foundations of Computer Science\u00a01(2), 131\u2013150 (1990)","journal-title":"International Journal on Foundations of Computer Science"},{"key":"27_CR13","unstructured":"Li, K., Cheng, K.-H.: A generalized harmonic algorithm for on-line multidimensional bin packing. Technical Report UH-CS-90-2, University of Houston (January 1990)"},{"issue":"4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1137\/S0895480100369948","volume":"14","author":"S.S. Seiden","year":"2001","unstructured":"Seiden, S.S.: An optimal online algorithm for bounded space variable-sized bin packing. SIAM Journal on Discrete Mathematics\u00a014(4), 458\u2013470 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"5","key":"27_CR15","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. Journal of the ACM\u00a049(5), 640\u2013671 (2002)","journal-title":"Journal of the ACM"},{"issue":"3","key":"27_CR16","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 multi-dimensional packing. Algorithmica\u00a036(3), 261\u2013293 (2003)","journal-title":"Algorithmica"},{"key":"27_CR17","unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ (1971)"},{"key":"27_CR18","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\u00a043, 277\u2013284 (1992)","journal-title":"Information Processing Letters"},{"key":"27_CR19","unstructured":"van Vliet, A.: Lower and upper bounds for online bin packing and scheduling heuristics. PhD thesis, Erasmus University, Rotterdam, The Netherlands (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T22:53:43Z","timestamp":1553122423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}