{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:46Z","timestamp":1725892606963},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"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-21204-8_21","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T01:15:25Z","timestamp":1306545325000},"page":"176-184","source":"Crossref","is-referenced-by-count":0,"title":["2D Knapsack: Packing Squares"],"prefix":"10.1007","author":[{"given":"Min","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenyang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Attila","family":"Benko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","first-page":"761","volume":"222","author":"L.G. Babat","year":"1975","unstructured":"Babat, L.G.: Linear functions on the N-dimensional unit cube. Dokl. Akad. Nauk SSSR\u00a0222, 761\u2013762 (1975) (Russian)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A. Caprara","year":"2004","unstructured":"Caprara, A., Monaci, M.: On the two-dimensional knapsack problem. Operations Research Letters\u00a032, 5\u201314 (2004)","journal-title":"Operations Research Letters"},{"issue":"1-2","key":"21_CR3","first-page":"15","volume":"10","author":"J. Csirik","year":"1991","unstructured":"Csirik, J., Frenk, J.B.G., Labb\u00e9, M., Zhang, S.: Heuristics for the 0-1 Min-Knapsack problem. Acta Cybernetica\u00a010(1-2), 15\u201320 (1991)","journal-title":"Acta Cybernetica"},{"key":"21_CR4","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":"21_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0167-6377(99)00066-8","volume":"26","author":"M.M. G\u00fcntzer","year":"2000","unstructured":"G\u00fcntzer, M.M., Jungnickel, D.: Approximate minimization algorithms for the 0\/1 knapsack and subset-sum problem. Operations Research Letters\u00a026, 55\u201366 (2000)","journal-title":"Operations Research Letters"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/1008861.1008867","volume":"12","author":"G. Gene","year":"1980","unstructured":"Gene, G., Levner, E.: Complexity of approximation algorithms for combinatorial problems: a survey. ACM SIGACT News\u00a012(3), 52\u201365 (1980)","journal-title":"ACM SIGACT News"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00224-007-9039-0","volume":"43","author":"X. Han","year":"2008","unstructured":"Han, X., Iwama, K., Zhang, G.: Online Removable Square Packing. Theory Computing Systems\u00a043(1), 38\u201355 (2008)","journal-title":"Theory Computing Systems"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-12450-1_17","volume-title":"Approximation and Online Algorithms","author":"X. Han","year":"2010","unstructured":"Han, X., Makino, K.: Online minimization knapsack problem. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 182\u2013193. Springer, Heidelberg (2010)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-10631-6_36","volume-title":"Algorithms and Computation","author":"X. Han","year":"2009","unstructured":"Han, X., Makino, K.: Online removable knapsack with limited cuts. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 341\u2013351. Springer, Heidelberg (2009)"},{"issue":"44","key":"21_CR10","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\u00a0410(44), 4504\u20134532 (2009)","journal-title":"Theoretical Computer Science"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11940128_9","volume-title":"Algorithms and Computation","author":"T. Horiyama","year":"2006","unstructured":"Horiyama, T., Iwama, K., Kawahara, J.: Finite-State Online Algorithms and Their Automated Competitive Analysis. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 71\u201380. Springer, Heidelberg (2006)"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM\u00a022, 463\u2013468 (1975)","journal-title":"Journal of the ACM"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45465-9_26","volume-title":"Automata, Languages and Programming","author":"K. Iwama","year":"2002","unstructured":"Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 293\u2013305. Springer, Heidelberg (2002)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-74208-1_13","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K. Iwama","year":"2007","unstructured":"Iwama, K., Zhang, G.: Optimal resource augmentations for online knapsack. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 180\u2013188. Springer, Heidelberg (2007)"},{"issue":"3","key":"21_CR15","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"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-68891-4_13","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Jansen","year":"2008","unstructured":"Jansen, K., Solis-Oba, R.: A Polynomial Time Approximation Scheme for the Square Packing Problem. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 184\u2013198. Springer, Heidelberg (2008)"},{"key":"21_CR17","doi-asserted-by":"publisher","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, Heidelberg (2004)"},{"unstructured":"Lueker, G.S.: Average-case analysis of off-line and on-line knapsack problems. In: Proc. Sixth Annual ACM-SIAM SODA, pp. 179\u2013188 (1995)","key":"21_CR18"},{"issue":"1, Ser. A","key":"21_CR19","first-page":"73","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Math. Programming\u00a068(1, Ser. A), 73\u2013104 (1995)","journal-title":"Math. Programming"},{"doi-asserted-by":"crossref","unstructured":"Noga, J., Sarbua, V.: An online partially fractional knapsack problem. In: ISPAN 2005, pp. 108\u2013112 (2005)","key":"21_CR20","DOI":"10.1109\/ISPAN.2005.19"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T22:53:45Z","timestamp":1553727225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}