{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:57:17Z","timestamp":1725555437489},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642124495"},{"type":"electronic","value":"9783642124501"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12450-1_4","type":"book-chapter","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T19:01:49Z","timestamp":1273086109000},"page":"37-48","source":"Crossref","is-referenced-by-count":12,"title":["Approximation Algorithms for Multiple Strip Packing"],"prefix":"10.1007","author":[{"given":"Marin","family":"Bougeret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre Francois","family":"Dutot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christina","family":"Otte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Bansal, N., Caprara, A., Jansen, K., Pr\u00e4del, L., Sviridenko, M.: How to maximize the total area of rectangle packed into a rectangle. To appear in The 20th International Symposium on Algorithms and Computation, ISAAC 2009 (2009)"},{"key":"4_CR2","unstructured":"Bansal, N., Han, X., Iwama, K., Sviridenko, M., Zhang, G.: Harmonic algorithm for 3-dimensional strip packing problem. In: Proceedings of the eighteenth ACM-SIAM symposium on Discrete algorithm (SODA 2007), pp. 1197\u20131206 (2007)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Packing 2-dimensional bins in harmony. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 490\u2013499 (2002)","DOI":"10.1109\/SFCS.2002.1181973"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Caprara, A., Lodi, A., Monaci, M.: An approximation scheme for the two-stage, two-dimensional bin packing problem. In: Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization, pp. 315\u2013328 (2002)","DOI":"10.1007\/3-540-47867-1_23"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Jansen, K., Pr\u00e4del, L., Schwarz, U.M.: Two for one: Tight approximation of 2d bin packing. In: Algorithms and Data Structures Symposium, WADS 2009 (2009)","DOI":"10.1007\/978-3-642-03367-4_35"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic approximation algorithm for 3d-strip packing. In: Proceedings of the seventeenth ACM-SIAM symposium on Discrete algorithm (SODA 2006), pp. 143\u2013152 (2006)","DOI":"10.1145\/1109557.1109575"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.disopt.2009.04.001","volume":"6","author":"K. Jansen","year":"2009","unstructured":"Jansen, K., Solis-Oba, R.: New approximability results for 2-dimensional packing problems. Journal of Discrete Optimization\u00a06, 310\u2013323 (2009)","journal-title":"Journal of Discrete Optimization"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman Jr.","year":"1980","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal of Computing\u00a09(4), 808\u2013826 (1980)","journal-title":"SIAM Journal of Computing"},{"key":"4_CR9","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., R\u00e9mila, 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":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/10719839_6","volume-title":"LATIN 2000: Theoretical Informatics","author":"F. Miyazawa","year":"2000","unstructured":"Miyazawa, F., Wakabayashi, Y.: Cube packing. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 58\u201367. Springer, Heidelberg (2000)"},{"key":"4_CR11","first-page":"290","volume-title":"Proceedings of the Second European Symposium on Algorithms","author":"I. Schiermeyer","year":"1994","unstructured":"Schiermeyer, I.: Reverse-fit: A 2-optimal algorithm for packing rectangles. In: Proceedings of the Second European Symposium on Algorithms, pp. 290\u2013299. Springer, Heidelberg (1994)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1\u201310 (2008)","DOI":"10.1109\/IPDPS.2008.4536273"},{"issue":"2","key":"4_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 of Computing\u00a026(2), 401\u2013409 (1997)","journal-title":"SIAM Journal of Computing"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/11752578_93","volume-title":"Parallel Processing and Applied Mathematics","author":"A. Tchernykh","year":"2006","unstructured":"Tchernykh, A., Ram\u00edrez, J., Avetisyan, A., Kuzjurin, N., Grushin, D., Zhuk, S.: Two level job-scheduling strategies for a computational grid. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Wa\u015bniewski, J. (eds.) PPAM 2005. LNCS, vol.\u00a03911, pp. 774\u2013781. Springer, Heidelberg (2006)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Ye, D., Han, X., Zhang, G.: On-line multiple-strip packing. In: The 3rd Annual International Conference on Combinatorial Optimization and Applications COCOA 2009 (2009)","DOI":"10.1007\/978-3-642-02026-1_14"},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1515\/156939206776241264","volume":"16","author":"S.N. Zhuk","year":"2006","unstructured":"Zhuk, S.N.: Approximate algorithms to pack rectangles into several strips. Discrete Mathematics and Applications\u00a016(1), 73\u201385 (2006)","journal-title":"Discrete Mathematics and Applications"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12450-1_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:41:45Z","timestamp":1619782905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12450-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642124495","9783642124501"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12450-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}