{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:51:22Z","timestamp":1725544282151},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322078"},{"type":"electronic","value":"9783540322085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_17","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T04:26:35Z","timestamp":1139977595000},"page":"216-229","source":"Crossref","is-referenced-by-count":0,"title":["Online Removable Square Packing"],"prefix":"10.1007","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Bansal, N., Sviridenko, M.: New approximability and inapproximability results for 2-dimensional bin packing. In: SODA 2004, pp. 189\u2013196 (2004)"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00453-003-1036-3","volume":"37","author":"A. Borodin","year":"2003","unstructured":"Borodin, A., Nielsen, M.N., Rackoff, C. (Incremental) Priority agorithms. Algorithmica\u00a037(4), 295\u2013326 (2003)","journal-title":"Algorithmica"},{"key":"17_CR3","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"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-44867-5_5","volume-title":"Experimental and Efficient Algorithms","author":"M. Caramia","year":"2003","unstructured":"Caramia, M., Giordan, S., Iovanella, A.: An on-line algorithm for the rectangle packing problem with rejection. In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol.\u00a02647, pp. 59\u201369. Springer, Heidelberg (2003)"},{"key":"17_CR5","unstructured":"Correa, J.R., Kenyon, C.: Approximation schemes for multidimensional packing. In: SODA, pp. 179\u2013188 (2004)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Epstein, L., van Stee, R.: Optimal online bounded space multidimensional packing. In: SODA 2004, pp. 207\u2013216 (2004)","DOI":"10.1007\/978-3-540-30140-0_27"},{"key":"17_CR7","first-page":"223","volume":"19","author":"C.E. Ferreira","year":"1999","unstructured":"Ferreira, C.E., Miyazawa, E.K., Wakabayashi, Y.: Packing squares into squares. Pesquisa Operacional\u00a019, 223\u2013237 (1999)","journal-title":"Pesquisa Operacional"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029561","volume-title":"Online Algorithms","author":"A. Fiat","year":"1998","unstructured":"Fiat, A., Woeginger, G.J.: Online Algorithms. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01442. Springer, Heidelberg (1998)"},{"key":"17_CR9","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":"17_CR10","unstructured":"Jansen, K., Zhang, G.: On rectangle packing: maximizing benefits. In: SODA 2004, pp. 197\u2013206 (2004)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1004953109743","volume":"67","author":"J. Januszewski","year":"1997","unstructured":"Januszewski, J., Lassak, M.: On-line packing sequences of cubes in the unit cube. Geometriae Dedicata\u00a067, 285\u2013293 (1997)","journal-title":"Geometriae Dedicata"},{"issue":"3","key":"17_CR12","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\u00a040(3), 173\u2013187 (2004)","journal-title":"Algorithmica"},{"key":"17_CR13","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. J. Parallel Distrib. Comput.\u00a010, 271\u2013275 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S0021-9800(68)80047-X","volume":"5","author":"A. Meir","year":"1968","unstructured":"Meir, A., Moser, L.: On packing of squares and cubes. Journal of combinatorial theory\u00a05, 126\u2013134 (1968)","journal-title":"Journal of combinatorial theory"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/978-3-540-27836-8_92","volume-title":"Automata, Languages and Programming","author":"P. Sanders","year":"2004","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online Scheduling with Bounded Migration. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1111\u20131122. Springer, Heidelberg (2004)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"S.S. Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R.: New bounds for multidimensional packing. Algorithmica\u00a036, 261\u2013293 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:14:22Z","timestamp":1619493262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11671411_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}