{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:19Z","timestamp":1725465559977},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_8","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"85-96","source":"Crossref","is-referenced-by-count":1,"title":["Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items"],"prefix":"10.1007","author":[{"given":"Mihai","family":"Burcea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fencol C. C.","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1137\/S009753970240447X","volume":"32","author":"A. Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. SIAM J. Comput.\u00a032, 1091\u20131113 (2003)","journal-title":"SIAM J. Comput."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. ACM Trans. Algorithms\u00a03 (August 2007)","DOI":"10.1145\/1273340.1273344"},{"key":"8_CR3","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.tcs.2008.09.028","volume":"409","author":"J.W.-T. Chan","year":"2008","unstructured":"Chan, J.W.-T., Lam, T.-W., Wong, P.W.H.: Dynamic bin packing of unit fractions items. Theoretical Computer Science\u00a0409(3), 521\u2013529 (2008)","journal-title":"Theoretical Computer Science"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00453-008-9185-z","volume":"53","author":"J.W.-T. Chan","year":"2009","unstructured":"Chan, J.W.-T., Wong, P.W.H., Yung, F.C.C.: On dynamic bin packing: An improved lower bound and resource augmentation analysis. Algorithmica\u00a053, 172\u2013206 (2009)","journal-title":"Algorithmica"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1137\/S0895480197325936","volume":"13","author":"E.G. Coffman Jr.","year":"2000","unstructured":"Coffman Jr., E.G., Courcoubetis, C., Garey, M.R., Johnson, D.S., Shor, P.W., Weber, R.R., Yannakakis, M.: Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings. SIAM J. Discrete Math.\u00a013, 38\u2013402 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Coffman Jr., E.G., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: Combinatorial analysis. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization (1998)","DOI":"10.1007\/978-1-4757-3023-4_3"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/0885-064X(87)90009-4","volume":"3","author":"E.G. Coffman Jr.","year":"1987","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.: Bin packing with divisible item sizes. Journal of Complexity\u00a03, 405\u2013428 (1987)","journal-title":"Journal of Complexity"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/0212014","volume":"12","author":"E.G. Coffman Jr.","year":"1983","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Dynamic bin packing. SIAM J. Comput.\u00a012(2), 227\u2013258 (1983)","journal-title":"SIAM J. Comput."},{"key":"8_CR10","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46\u201393. PWS Publishing (1996)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0167-6377(89)90027-8","volume":"8","author":"D. Coppersmith","year":"1989","unstructured":"Coppersmith, D., Raghavan, P.: Multidimensional on-line bin packing: Algorithms and worst-case analysis. Operations Research Letters\u00a08(1), 17\u201320 (1989)","journal-title":"Operations Research Letters"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) On-line Algorithms\u2013The State of the Art, pp. 147\u2013177. Springer (1996)","DOI":"10.1007\/BFb0029568"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.jda.2010.07.002","volume":"8","author":"L. Epstein","year":"2010","unstructured":"Epstein, L., Levy, M.: Dynamic multi-dimensional bin packing. J. of Discrete Algorithms\u00a08, 356\u2013372 (2010)","journal-title":"J. of Discrete Algorithms"},{"key":"8_CR14","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1016\/j.ipl.2010.09.002","volume":"110","author":"X. Han","year":"2010","unstructured":"Han, X., Peng, C., Ye, D., Zhang, D., Lan, Y.: Dynamic bin packing with unit fraction items revisited. Inf. Process. Lett.\u00a0110, 1049\u20131054 (2010)","journal-title":"Inf. Process. Lett."},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-70575-8_20","volume-title":"Automata, Languages and Programming","author":"K. Jansen","year":"2008","unstructured":"Jansen, K., Th\u00f6le, R.: Approximation algorithms for scheduling parallel jobs: Breaking the approximation ratio of 2. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 234\u2013245. Springer, Heidelberg (2008)"},{"issue":"9","key":"8_CR17","doi-asserted-by":"publisher","first-page":"2589","DOI":"10.1016\/j.cor.2005.10.001","volume":"34","author":"F. Miyazawa","year":"2007","unstructured":"Miyazawa, F., Wakabayashi, Y.: Two- and three-dimensional parametric packing. Computers & Operations Research\u00a034(9), 2589\u20132603 (2007)","journal-title":"Computers & Operations Research"},{"issue":"2","key":"8_CR18","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 2. SIAM J. Comput.\u00a026(2), 401\u2013409 (1997)","journal-title":"SIAM J. Comput."},{"key":"8_CR19","unstructured":"van Stee, R.: Combinatorial algorithms for packing and scheduling problems. Habilitation thesis, Universit\u00e4t Karlsruhe (June 2008), \n                  \n                    http:\/\/www.mpi-inf.mpg.de\/~vanstee\/habil.pdf\n                  \n                  \n                 (accessed November 2012)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-12450-1_22","volume-title":"Approximation and Online Algorithms","author":"P.W.H. Wong","year":"2010","unstructured":"Wong, P.W.H., Yung, F.C.C.: Competitive multi-dimensional dynamic bin packing via L-shape bin packing. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 242\u2013254. Springer, Heidelberg (2010)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-35261-4_8","volume-title":"Algorithms and Computation","author":"P.W.H. Wong","year":"2012","unstructured":"Wong, P.W.H., Yung, F.C.C., Burcea, M.: An 8\/3 lower bound for online dynamic bin packing. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 44\u201353. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T01:27:40Z","timestamp":1557710860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}