{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:34:04Z","timestamp":1753738444340},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_40","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:41:31Z","timestamp":1312879291000},"page":"475-487","source":"Crossref","is-referenced-by-count":11,"title":["A (5\/3\u2009+\u2009\u03b5)-Approximation for Strip Packing"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Harren","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Pr\u00e4del","sequence":"additional","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"40_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(4), 348\u2013368 (1981)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"40_CR2","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B.S. Baker","year":"1980","unstructured":"Baker, B.S., Coffman Jr., E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing\u00a09(4), 846\u2013855 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Caprara, A., Jansen, K., Pr\u00e4del, L., Sviridenko, M.: A structural lemma in 2-dimensional packing, and its implications on approximability. In: ISAAC: Proc. 20th International Symposium on Algorithms and Computation, pp. 77\u201386 (2009)","DOI":"10.1007\/978-3-642-10631-6_10"},{"issue":"4","key":"40_CR4","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1137\/080736831","volume":"39","author":"N. Bansal","year":"2009","unstructured":"Bansal, N., Caprara, A., Sviridenko, M.: A new approximation method for set covering problems, with applications to multidimensional bin packing. SIAM Journal on Computing\u00a039(4), 1256\u20131278 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"40_CR5","doi-asserted-by":"publisher","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.: Bin packing in multiple dimensions: Inapproximability results and approximation schemes. Mathematics on Operation Research\u00a031(1), 31\u201349 (2006)","journal-title":"Mathematics on Operation Research"},{"issue":"4","key":"40_CR6","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 on Computing\u00a09(4), 808\u2013826 (1980)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"40_CR7","doi-asserted-by":"publisher","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 Journal on Computing\u00a010(3), 571\u2013582 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Harren, R., Jansen, K., Pr\u00e4del, L., van Stee, R.: A (5\/3 + \u03b5)-approximation for strip packing. Technical Report 1105. University of Kiel (2011), http:\/\/www.informatik.uni-kiel.de\/en\/ifi\/research\/technical-reports\/","DOI":"10.1007\/978-3-642-22300-6_40"},{"key":"40_CR9","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 2009 and RANDOM 2009. LNCS, vol.\u00a05687, pp. 177\u2013189. Springer, Heidelberg (2009)"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Jansen, K., Pr\u00e4del, L., Schwarz, U.M.: Two for one: Tight approximation of 2d bin packing. In: WADS: Proc. Workshop on Algorithms and Data Structures, pp. 399\u2013410 (2009)","DOI":"10.1007\/978-3-642-03367-4_35"},{"issue":"3","key":"40_CR11","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.: Rectangle packing with one-dimensional resource augmentation. Discrete Optimization\u00a06(3), 310\u2013323 (2009)","journal-title":"Discrete Optimization"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-70575-8_20","volume-title":"Automata, Languages and Programming","author":"K. Jansen","year":"2008","unstructured":"Jansen, K., Th\u00f6le, R.: Approximation algorithms for scheduling parallel jobs: Breaking the approximation ratio of 2. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 234\u2013245. Springer, Heidelberg (2008)"},{"issue":"3","key":"40_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00453-006-0194-5","volume":"47","author":"K. Jansen","year":"2007","unstructured":"Jansen, K., Zhang, G.: Maximizing the total profit of rectangles packed into a rectangle. Algorithmica\u00a047(3), 323\u2013342 (2007)","journal-title":"Algorithmica"},{"issue":"4","key":"40_CR14","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(4), 645\u2013656 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"40_CR15","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)"},{"issue":"1","key":"40_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(80)90121-0","volume":"10","author":"D.D. Sleator","year":"1980","unstructured":"Sleator, D.D.: A 2.5 times optimal algorithm for packing in two dimensions. Information Processing Letters\u00a010(1), 37\u201340 (1980)","journal-title":"Information Processing Letters"},{"issue":"2","key":"40_CR17","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","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T18:54:10Z","timestamp":1560452050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}