{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:54:29Z","timestamp":1781078069509,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223399","type":"print"},{"value":"9783540278108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_31","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T13:27:29Z","timestamp":1279027649000},"page":"362-371","source":"Crossref","is-referenced-by-count":14,"title":["Maximizing the Number of Packed Rectangles"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1137\/0604039","volume":"4","author":"B.S. Baker","year":"1983","unstructured":"Baker, B.S., Calderbank, A.R., Coffman, E.G., Lagarias, J.C.: Approximation algorithms for maximizing the number of squares packed into a rectangle. SIAM J. on Algebraic and Discrete Methods\u00a04, 383\u2013397 (1983)","journal-title":"SIAM J. on Algebraic and Discrete Methods"},{"key":"31_CR2","unstructured":"Bansal, N., Sviridenko, M.: New approximability and inapproximability results for 2-dimensional bin packing. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 189\u2013196 (2004)"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A. Caprara","year":"2004","unstructured":"Caprara, A., Monaci, M.: On the two-dimensional knapsack problem. Operations Research Letters\u00a032, 5\u201314 (2004)","journal-title":"Operations Research Letters"},{"key":"31_CR4","unstructured":"Correa, J.R., Kenyon, C.: Approximation schemes for multidimensional packing. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 179\u2013188 (2004)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM\u00a032, 130\u2013136 (1985)","journal-title":"Journal of ACM"},{"key":"31_CR6","unstructured":"Jansen, K., Zhang, G.: On rectangle packing: maximizing benefits. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 197\u2013206 (2004)"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C. Kenyon","year":"2000","unstructured":"Kenyon, C., Remila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research\u00a025, 645\u2013656 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"31_CR8","doi-asserted-by":"publisher","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.Y.L.: Packing squares into a square. J. Parallel Distrib. Comput.\u00a010, 271\u2013275 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BFb0049416","volume-title":"Algorithms - ESA \u201994","author":"I. Schiermeyer","year":"1994","unstructured":"Schiermeyer, I.: Reverse-fit: a 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 290\u2013299. Springer, Heidelberg (1994)"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM J. Computing\u00a026, 401\u2013409 (1997)","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:27:11Z","timestamp":1619998031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}