{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:38:32Z","timestamp":1648816712700},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10951-009-0110-3","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T16:41:07Z","timestamp":1240591267000},"page":"63-75","source":"Crossref","is-referenced-by-count":6,"title":["Absolute approximation ratios for packing rectangles into bins"],"prefix":"10.1007","volume":"15","author":[{"given":"Rolf","family":"Harren","sequence":"first","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,4,25]]},"reference":[{"key":"110_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Caprara, A., & Sviridenko, M. (2006a). Improved approximation algorithms for multidimensional bin packing problems. In FOCS: proceedings of the 47nd IEEE symposium on foundations of computer science (pp. 697\u2013708).","DOI":"10.1109\/FOCS.2006.38"},{"issue":"1","key":"110_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/moor.1050.0168","volume":"31","author":"N. Bansal","year":"2006","unstructured":"Bansal, N., Correa, J. R., Kenyon, C., & Sviridenko, M. (2006b). Bin packing in multiple dimensions\u2014inapproximability results and approximation schemes. Mathematics of Operations Research, 31(1), 31\u201349.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"110_CR3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/moor.1040.0112","volume":"30","author":"A. Caprara","year":"2005","unstructured":"Caprara, A., Lodi, A., & Monaci, M. (2005). Fast approximation schemes for two-stage, two-dimensional bin packing. Mathematics of Operations Research, 30(1), 150\u2013172.","journal-title":"Mathematics of Operations Research"},{"key":"110_CR4","unstructured":"Chleb\u00edk, M., & Chleb\u00edkov\u00e1, J. (2006). Inapproximability results for orthogonal rectangle packing problems with rotations. In CIAC: proceedings of the 6th conference on algorithms and complexity (pp.\u00a0199\u2013210)."},{"issue":"1","key":"110_CR5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1137\/0603007","volume":"3","author":"F. R. K. Chung","year":"1982","unstructured":"Chung, F. R. K., Garey, M. R., & Johnson, D. S. (1982). On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods, 3(1), 66\u201376.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"4","key":"110_CR6","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E. G. Coffman Jr.","year":"1980","unstructured":"Coffman, E. G. Jr., Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4), 808\u2013826.","journal-title":"SIAM Journal on Computing"},{"key":"110_CR7","unstructured":"Jansen, K., & Solis-Oba, R. (2007). New approximability results for 2-dimensional packing problems. In MFCS: proceedings of the 32nd international symposium on mathematical foundations of computer science (pp.\u00a0103\u2013114)."},{"key":"110_CR8","unstructured":"Jansen, K., & van Stee, R. (2005). On strip packing with rotations. In STOC: proceedings of the 37th ACM symposium on theory of computing (pp. 755\u2013761)."},{"issue":"3","key":"110_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s00453-006-0194-5","volume":"47","author":"K. Jansen","year":"2007","unstructured":"Jansen, K., & Zhang, G. (2007). Maximizing the total profit of rectangles packed into a rectangle. Algorithmica, 47(3), 323\u2013342.","journal-title":"Algorithmica"},{"key":"110_CR10","unstructured":"Johnson, D. S. (1973). Near optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Department of Mathematics."},{"issue":"4","key":"110_CR11","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C. Kenyon","year":"2000","unstructured":"Kenyon, C., & R\u00e9mila, E. (2000). A near optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 25(4), 645\u2013656.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"110_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"J. Y.-T. Leung","year":"1990","unstructured":"Leung, J. Y.-T., Tam, T. W., Wong, C. S., Young, G. H., & Chin, F.\u00a0Y. (1990). Packing squares into a square. Journal of Parallel and Distributed Computing, 10(3), 271\u2013275.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"110_CR13","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/S0021-9800(68)80047-X","volume":"5","author":"A. Meir","year":"1968","unstructured":"Meir, A., & Moser, L. (1968). On packing of squares and cubes. Journal of Combinatorial Theory, 5(2), 126\u2013134.","journal-title":"Journal of Combinatorial Theory"},{"key":"110_CR14","unstructured":"Schiermeyer, I. (1994). Reverse-fit: A 2-optimal algorithm for packing rectangles. In ESA: proceedings of the 2nd European symposium on algorithms (pp.\u00a0290\u2013299)."},{"issue":"2","key":"110_CR15","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"Steinberg, A. (1997). A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26(2), 401\u2013409.","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"110_CR16","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.orl.2004.02.003","volume":"32","author":"R. Stee van","year":"2004","unstructured":"van Stee, R. (2004). An approximation algorithm for square packing. Operations Research Letters, 32(6), 535\u2013539.","journal-title":"Operations Research Letters"},{"issue":"2","key":"110_CR17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.orl.2004.04.004","volume":"33","author":"G. Zhang","year":"2005","unstructured":"Zhang, G. (2005). A 3-approximation algorithm for two-dimensional bin packing. Operations Research Letters, 33(2), 121\u2013126.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0110-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:47:07Z","timestamp":1558288027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0110-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,25]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0110-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,25]]}}}