{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:26:57Z","timestamp":1736573217978,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_33","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"309-319","source":"Crossref","is-referenced-by-count":6,"title":["On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis"],"prefix":"10.1007","author":[{"given":"Wun-Tat","family":"Chan","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":"33_CR1","first-page":"224","volume-title":"SODA","author":"A. Bar-Noy","year":"2004","unstructured":"Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. In: Munro, J.I. (ed.) SODA, pp. 224\u2013233. SIAM, Philadelphia (2004)"},{"key":"33_CR2","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, Cambridge (1998)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/11523468_50","volume-title":"Automata, Languages and Programming","author":"W.T. Chan","year":"2005","unstructured":"Chan, W.T., Lam, T.W., Wong, P.W.H.: Dynamic bin packing of unit fractions items. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 614\u2013626. Springer, Heidelberg (2005)"},{"key":"33_CR4","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":"33_CR5","volume-title":"Handbook of Combinatorial Optimization","author":"E.G. Coffman Jr.","year":"1998","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. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"33_CR6","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., Johnson, D.: Bin packing with divisible item sizes. Journal of Complexity\u00a03, 405\u2013428 (1987)","journal-title":"Journal of Complexity"},{"issue":"2","key":"33_CR7","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":"33_CR8","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Bin packing approximation algorithms: A survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, PWS, pp. 46\u201393 (1996)"},{"key":"33_CR9","unstructured":"Coffman Jr., E.G., Johnson, D.S., McGeoch, L.A., Shor, P.W., Weber, R.R.: Bin packing with discrete item sizes, Part III: Average case behavior of FFD and BFD (in preparation)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<69::AID-RSA4>3.0.CO;2-V","volume":"10","author":"E.G. Coffman Jr.","year":"1997","unstructured":"Coffman Jr., E.G., Johnson, D.S., Shor, P.W., Weber, R.R.: Bin packing with discrete item sizes, Part II: Tight bounds on first fit. Random Structures and Algorithms\u00a010, 69\u2013101 (1997)","journal-title":"Random Structures and Algorithms"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online Algorithms","author":"J. Csirik","year":"1998","unstructured":"Csirik, J., Woeginger, G.J.: Online packing and covering problems. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01442, pp. 147\u2013177. Springer, Heidelberg (1998)"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0196-6774(02)00202-X","volume":"44","author":"J. Csirik","year":"2002","unstructured":"Csirik, J., Woeginger, G.J.: Resource augmentation for online bounded space bin packing. J. Algorithms\u00a044(2), 308\u2013320 (2002)","journal-title":"J. Algorithms"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-31833-0_4","volume-title":"Approximation and Online Algorithms","author":"L. Epstein","year":"2005","unstructured":"Epstein, L., van Stee, R.: Online bin packing with resource augmentation. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 23\u201335. Springer, Heidelberg (2005)"},{"issue":"2","key":"33_CR14","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1137\/S0097539794276749","volume":"28","author":"Z. Ivkovic","year":"1998","unstructured":"Ivkovic, Z., Lloyd, E.L.: Fully dynamic algorithms for bin packing: Being (mostly) myopic helps. SIAM J. Comput.\u00a028(2), 574\u2013611 (1998)","journal-title":"SIAM J. Comput."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. In: 36th Annual Symposium on Foundations of Computer Science, pp. 214\u2013221 (1995)","DOI":"10.1109\/SFCS.1995.492478"},{"issue":"5","key":"33_CR16","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S.S. Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. ACM\u00a049(5), 640\u2013671 (2002)","journal-title":"J. ACM"},{"issue":"5","key":"33_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A. Vliet van","year":"1992","unstructured":"van Vliet, A.: An improved lower bound for on-line bin packing algorithms. Inf. Process. Lett.\u00a043(5), 277\u2013284 (1992)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:07:16Z","timestamp":1736514436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11809678_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}