{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:34:56Z","timestamp":1725824096706},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_21","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T11:12:41Z","timestamp":1435057961000},"page":"264-276","source":"Crossref","is-referenced-by-count":0,"title":["Packing Cubes into a Cube in (D>3)-Dimensions"],"prefix":"10.1007","author":[{"given":"Yiping","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny Z.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Cha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"1","key":"21_CR1","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 of Operations Research 31(1), 31\u201349 (2006)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1287\/moor.1040.0112","volume":"30","author":"A Caprara","year":"2005","unstructured":"Caprara, A., Lodi, A., Monaci, M.: Fast Approximation Schemes for Two-stage, Two-dimensional Bin Packing. Mathematics of Operations Research 30, 136\u2013156 (2005)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/0603007","volume":"3","author":"FRK Chung","year":"1982","unstructured":"Chung, F.R.K., Garey, M.R., Johnson, D.S.: On Packing Two-dimensional Bins. SIAM Journal on Algebraic and Discrete Methods 3, 66\u201376 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"21_CR4","unstructured":"Correa, J.R., Kenyon, C.: Approximation schemes for multidimensional packing. In: Proc. 15th ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 179\u2013188 (2004)"},{"issue":"9","key":"21_CR5","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00236-005-0169-z","volume":"41","author":"L Epstein","year":"2005","unstructured":"Epstein, L., van Stee, R.: Online Square and Cube Packing. Acta Informatica 41(9), 595\u2013606 (2005)","journal-title":"Acta Informatica"},{"key":"21_CR6","volume-title":"Computer and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computer and Intractability \u2013 A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"44","key":"21_CR7","doi-asserted-by":"publisher","first-page":"4504","DOI":"10.1016\/j.tcs.2009.07.030","volume":"410","author":"R Harren","year":"2009","unstructured":"Harren, R.: Approximation Algorithms for Orthogonal Packing Problems for Hypercubes. Theoretical Computer Science 410(44), 4504\u20134532 (2009)","journal-title":"Theoretical Computer Science"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-004-1102-5","volume":"40","author":"Y Kohayakawa","year":"2004","unstructured":"Kohayakawa, Y., Miyazawa, F.K., Raghavan, P., Wakabayashi, Y.: Multidimensional Cube Packing. Algorithmica 40, 173\u2013187 (2004)","journal-title":"Algorithmica"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"JY-T Leung","year":"1990","unstructured":"Leung, J.Y.-T., Tam, W.T., Wong, C.S., Chin, F.Y.L.: Packing Squares into a Square. Journal of Parallel and Distributed Computing 10, 271\u2013275 (1990)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"21_CR10","unstructured":"Li, K., Cheng, K.H.: Complexity of resource allocation and job scheduling problems in partitionable mesh connected systems. In: Proc. of 1st Annual IEEE Symposium of Parallel and Distributed Processing, pp. 358\u2013365. Silver Spring, MD (1989)"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10878-013-9701-1","volume":"29","author":"Y Lu","year":"2015","unstructured":"Lu, Y., Chen, D.Z., Cha, J.: Packing Cubes into a Cube is NP-complete in the Strong Sense. Journal of Combinatorial Optimization 29(1), 197\u2013215 (2015)","journal-title":"Journal of Combinatorial Optimization"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0304-3975(02)00647-3","volume":"297","author":"FK Miyazawa","year":"2003","unstructured":"Miyazawa, F.K., Wakabayashi, Y.: Cube Packing. Theoretical Computer Science 297, 355\u2013366 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T04:22:09Z","timestamp":1559190129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}