{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T14:40:07Z","timestamp":1736520007208,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_22","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"238-249","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the Orthogonal Knapsack Problem for Hypercubes"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Harren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Bansal, N., Correa, J.R., Kenyon, C., Sviridenko, M.: Bin packing in multiple dimensions - inapproximability results and approximation schemes. Mathematics of Operations Research (to appear)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Packing 2-dimensional bins in harmony. In: FOCS: Proc. 43rd IEEE Symposium on Foundations of Computer Science, pp. 490\u2013499 (2002)","DOI":"10.1109\/SFCS.2002.1181973"},{"issue":"4","key":"22_CR3","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 of Computing\u00a09(4), 808\u2013826 (1980)","journal-title":"SIAM Journal of Computing"},{"key":"22_CR4","unstructured":"Diedrich, F., Harren, R., Jansen, K., Th\u00f6le, R.: Approximation algorithms for a three-dimensional orthogonal knapsack problem (to appear 2006)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Fishkin, A.V., Gerber, O., Jansen, K.: On weighted rectangle packing with large resources. In: IFIP TCS 2004: 18th World Computer Congress, TC1 3rd Int. Conference on Theoretical Computer Science, pp. 237\u2013250 (2004)","DOI":"10.1007\/1-4020-8141-3_20"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Fishkin, A.V., Gerber, O., Jansen, K., Solis-Oba, R.: Packing weighted rectangles into a square. In: MFCS 2005: Proc. 30th Int. Symposium on Mathematical Foundations of Computer Sience, pp. 352\u2013363 (2005)","DOI":"10.1007\/11549345_31"},{"issue":"5","key":"22_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/B:JOSH.0000036860.90818.5f","volume":"7","author":"A. Freund","year":"2004","unstructured":"Freund, A., Naor, J.: Approximating the advertisement placement problem. Journal of Scheduling\u00a07(5), 365\u2013374 (2004)","journal-title":"Journal of Scheduling"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic approximation algorithm for 3d-strip packing. In: SODA 2006: Proc. 17th ACM-SIAM symposium on Discrete algorithm, pp. 143\u2013152 (2006)","DOI":"10.1145\/1109557.1109575"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Jansen, K., van Stee, R.: On strip packing with rotations. In: STOC 2005: Proc. 37th annual ACM symposium on Theory of Computing, pp. 755\u2013761 (2005)","DOI":"10.1145\/1060590.1060702"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Jansen, K., Zhang, G.: Maximizing the number of packed rectangles. In: SWAT 2004: Proc. 9th Scandinavian Workshop on Algorithm Theory, pp. 362\u2013371 (2004)","DOI":"10.1007\/978-3-540-27810-8_31"},{"key":"22_CR11","unstructured":"Jansen, K., Zhang, G.: On rectangle packing: Maximizing benefits. In: SODA 2004: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 204\u2013213 (2004)"},{"key":"22_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"22_CR13","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. MOR: Mathematics of Operations Research\u00a025, 645\u2013656 (2000)","journal-title":"MOR: Mathematics of Operations Research"},{"issue":"3","key":"22_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.: Packing squares into a square. Journal of Parallel and Distributed Computing\u00a010(3), 271\u2013275 (1990)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"22_CR15","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T16:15:08Z","timestamp":1736439308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11786986_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}