{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:34Z","timestamp":1759637734540},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_32","type":"book-chapter","created":{"date-parts":[[2017,2,19]],"date-time":"2017-02-19T20:12:36Z","timestamp":1487535156000},"page":"409-420","source":"Crossref","is-referenced-by-count":6,"title":["Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Malin","family":"Rau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"32_CR1","unstructured":"Adamaszek, A., Kociumaka, T., Pilipczuk, M., Pilipczuk, M.: Hardness of approximation for strip packing. CoRR abs\/1610.07766 (2016)"},{"issue":"4","key":"32_CR2","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0196-6774(81)90034-1","volume":"2","author":"B Baker","year":"1981","unstructured":"Baker, B., Brown, D., Katseff, H.: A $$5\/4$$ algorithm for two-dimensional packing. J. Algorithms 2(4), 348\u2013368 (1981)","journal-title":"J. Algorithms"},{"issue":"4","key":"32_CR3","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B Baker","year":"1980","unstructured":"Baker, B., Coffman Jr., E.G., Rivest, R.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846\u2013855 (1980)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"32_CR4","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E Coffman Jr","year":"1980","unstructured":"Coffman Jr., E., Garey, M., Johnson, D., Tarjan, R.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9(4), 808\u2013826 (1980)","journal-title":"SIAM J. Comput."},{"key":"32_CR5","unstructured":"G\u00e1lvez, W., Grandoni, F., Ingala, S., Khan, A.: Improved pseudo-polynomial-time approximation for strip packing. In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, 13\u201315 December 2016, Chennai, India, pp. 9:1\u20139:14 (2016)"},{"issue":"3","key":"32_CR6","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0210042","volume":"10","author":"I Golan","year":"1981","unstructured":"Golan, I.: Performance bounds for orthogonal oriented two-dimensional packing algorithms. SIAM J. Comput. 10(3), 571\u2013582 (1981)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"32_CR7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.comgeo.2013.08.008","volume":"47","author":"R Harren","year":"2014","unstructured":"Harren, R., Jansen, K., Pr\u00e4del, L., Van Stee, R.: A ( $$5\/3+\\varepsilon $$ )-approximation for strip packing. Comput. Geom. 47(2), 248\u2013267 (2014)","journal-title":"Comput. Geom."},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-03685-9_14","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"R Harren","year":"2009","unstructured":"Harren, R., van Stee, R.: Improved absolute approximation ratios for two-dimensional packing problems. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX\/RANDOM 2009. LNCS, vol. 5687, pp. 177\u2013189. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03685-9_14"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Jansen, K., Rau, M.: Improved approximation for two dimensional strip packing with polynomial bounded width. CoRR abs\/1610.04430 (2016)","DOI":"10.1007\/978-3-319-53925-6_32"},{"issue":"3","key":"32_CR10","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.disopt.2009.04.001","volume":"6","author":"K Jansen","year":"2009","unstructured":"Jansen, K., Solis-Oba, R.: Rectangle packing with one-dimensional resource augmentation. Discrete Optim. 6(3), 310\u2013323 (2009)","journal-title":"Discrete Optim."},{"issue":"8","key":"32_CR11","doi-asserted-by":"crossref","first-page":"3571","DOI":"10.1137\/080736491","volume":"39","author":"K Jansen","year":"2010","unstructured":"Jansen, K., Th\u00f6le, R.: Approximation algorithms for scheduling parallel jobs. SIAM J. Comput. 39(8), 3571\u20133615 (2010)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"32_CR12","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.: A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25(4), 645\u2013656 (2000)","journal-title":"Math. Oper. Res."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Nadiradze, G., Wiese, A.: On approximating strip packing with a better ratio than 3\/2. In: 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1491\u20131510. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch102"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BFb0049416","volume-title":"Algorithms \u2014 ESA \u201994","author":"I Schiermeyer","year":"1994","unstructured":"Schiermeyer, I.: Reverse-fit: a 2-optimal algorithm for packing rectangles. In: Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 290\u2013299. Springer, Heidelberg (1994). doi: 10.1007\/BFb0049416"},{"issue":"1","key":"32_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(80)90121-0","volume":"10","author":"D Sleator","year":"1980","unstructured":"Sleator, D.: A 2.5 times optimal algorithm for packing in two dimensions. Inf. Process. Lett. 10(1), 37\u201340 (1980)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"32_CR16","doi-asserted-by":"crossref","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. Comput. 26(2), 401\u2013409 (1997)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T17:30:47Z","timestamp":1568827847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}