{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:04:12Z","timestamp":1725548652900},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_11","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"103-114","source":"Crossref","is-referenced-by-count":17,"title":["New Approximability Results for 2-Dimensional Packing Problems"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Solis-Oba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.disopt.2006.09.001","volume":"4","author":"N. Bansal","year":"2007","unstructured":"Bansal, N., Sviridenko, M.: Two-dimensional bin packing with one dimensional resource augmentation. Discrete Optimization\u00a04, 143\u2013153 (2007)","journal-title":"Discrete Optimization"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman","year":"1980","unstructured":"Coffman, 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, 808\u2013826 (1980)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W.F. Vega de la","year":"1981","unstructured":"de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1+epsilon in linear time. Combinatorica\u00a01(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"Fishkin, A.V., Gerber, O., Jansen, K.: On weighted rectangle packing with large resources. In: Conference Theoretical Computer Science (TCS 2004), pp. 237\u2013250 (2004)","key":"11_CR4","DOI":"10.1007\/1-4020-8141-3_20"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11549345_31","volume-title":"Mathematical Foundations of Computer Science 2005","author":"A.V. Fishkin","year":"2005","unstructured":"Fishkin, A.V., Gerber, O., Jansen, K., Solis-Oba, R.: Packing weighted rectangles into a square. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 352\u2013363. Springer, Heidelberg (2005)"},{"key":"11_CR6","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., D. S., Johnson.: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11786986_22","volume-title":"Automata, Languages and Programming","author":"R. Harren","year":"2006","unstructured":"Harren, R.: Approximating the orthogonal knapsack problem for hypercubes. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Jansen, K., van Stee, R.: On strip packing with rotations. In: ACM Symposium on Theory of Computing. STOC 2005, pp. 755\u2013761 (2005)","key":"11_CR8","DOI":"10.1145\/1060590.1060702"},{"unstructured":"Jansen, K., Zhang, G.: On rectangle packing: maximizing benefits. In: ACM-SIAM Symposium on Discrete Algorithms. In: SODA 2004, pp. 197\u2013206 (2004)","key":"11_CR9"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/978-3-540-27810-8_31","volume-title":"Algorithm Theory - SWAT 2004","author":"K. Jansen","year":"2004","unstructured":"Jansen, K., Zhang, G.: Maximizing the number of packed rectangles. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 362\u2013371. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Karmarkar, M., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: IEEE Symposium on Foundations of Computer Science. FOCS 1982, pp. 312\u2013320 (1982)","key":"11_CR11","DOI":"10.1109\/SFCS.1982.61"},{"key":"11_CR12","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":"11_CR13","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E. Lawler","year":"1979","unstructured":"Lawler, E.: Fast approximation algorithms for knapsack problems. Mathematics of Operations Research\u00a04, 339\u2013356 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"11_CR14","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. Journal Parallel and Dist. Computing\u00a010, 271\u2013275 (1990)","journal-title":"Journal Parallel and Dist. Computing"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BFb0049416","volume-title":"Algorithms - ESA 1994","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":"11_CR16","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 two. SIAM Journal on Computing\u00a026, 401\u2013409 (1997)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:36Z","timestamp":1619519316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}