{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:19:37Z","timestamp":1725560377612},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_31","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"352-363","source":"Crossref","is-referenced-by-count":13,"title":["Packing Weighted Rectangles into a Square"],"prefix":"10.1007","author":[{"given":"Aleksei V.","family":"Fishkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Gerber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Solis-Oba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0196-6774(81)90034-1","volume":"2","author":"B.S. Baker","year":"1981","unstructured":"Baker, B.S., Brown, D.J., Katseff, H.P.: A 5\/4 algorithm for two dimensional packing. Journal of Algorithms\u00a02, 348\u2013368 (1981)","journal-title":"Journal of Algorithms"},{"key":"31_CR2","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 Journal on Algebraic and Discrete Methods\u00a04, 383\u2013397 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"31_CR3","unstructured":"Bansal, N., Sviridenko, M.: New approximability and inapproximability results for 2-dimensional bin packing. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 189\u2013196 (2004)"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Packing 2-dimensional bins in harmony. In: 43rd Annual Symposium on Foundations of Computer Science(FOCS), pp. 490\u2013499 (2002)","DOI":"10.1109\/SFCS.2002.1181973"},{"key":"31_CR5","doi-asserted-by":"publisher","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.: On packing two-dimentional bins. SIAM Journal on Algebraic and Discrete Methods\u00a03, 66\u201376 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"31_CR6","unstructured":"Correa, J.R., Kenyon, C.: Approximation schemes for multidimensional packing. In: Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 179\u2013188 (2004)"},{"key":"31_CR7","unstructured":"Fishkin, A.V., Gerber, O., Jansen, K., Solis-Oba, R.: On packing squares with resource augmentation: maximizing the profit. In: Computing: The Australasian Theory Symposium, CATS (2005)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Fishkin, A.V., Gerber, O., Jansen, K.: On weighted rectangle packing with large resources. In: 3rd IFIP International Conference on Theoretical Computer Science, pp. 237\u2013250 (2004)","DOI":"10.1007\/1-4020-8141-3_20"},{"key":"31_CR9","unstructured":"Jansen, K., Zhang, G.: On rectangle packing: maximizing benefits. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 197\u2013206 (2004)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Kenyon, C., R\u00e9mila, E.: Approximate strip-packing. In: 37th Annual Symposium on Foundations of Computer Science (FOCS), pp. 31\u201336 (1996)","DOI":"10.1109\/SFCS.1996.548461"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Schiermeyer, I.: Reverse fit: a 2-optimal algorithm for packing rectangles. In: 2nd European Symposium on Algorithms (ESA), pp. 290\u2013299 (1994)","DOI":"10.1007\/BFb0049416"},{"issue":"3","key":"31_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"S. Seiden","year":"2003","unstructured":"Seiden, S., van Stee, R.: New bounds for multi-dimentional packing. Algorithmica\u00a036(3), 261\u2013293 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"31_CR13","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 Journal on Computing\u00a026(2), 401\u2013409 (1997)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:58:25Z","timestamp":1619506705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11549345_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}