{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T23:03:49Z","timestamp":1784070229076,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819233083","type":"print"},{"value":"9789819233090","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-981-92-3309-0_23","type":"book-chapter","created":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:08:38Z","timestamp":1784066918000},"page":"301-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Fault-Tolerant Bin Packing Problem Revised"],"prefix":"10.1007","author":[{"given":"Yaojun","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"HanBin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,15]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3728642","volume":"21","author":"N Ayyadevara","year":"2025","unstructured":"Ayyadevara, N., Dabas, R., Khan, A., Sreenivas, K.V.N.: Near-optimal algorithms for stochastic online bin packing. ACM Trans. Algorithms 21(2), 1\u201339 (2025). https:\/\/doi.org\/10.1145\/3728642","journal-title":"ACM Trans. Algorithms"},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: Azar, Y., Bast, H., Herman, G. (eds.) 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0112, pp. 5:1\u20135:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.5","DOI":"10.4230\/LIPIcs.ESA.2018.5"},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Bastos, R.R., Paz\u00a0de Moura, B.M., Lucca, G., Santos, H.S., Yamin, A.C., Reiser, R.H.S.: Hybrid-FLBCC: virtual machine consolidation in cloud infrastructures exploring flexible computing. In: 2025 IEEE International Conference on Fuzzy Systems (FUZZ), pp.\u00a01\u20136. IEEE (2025). https:\/\/doi.org\/10.1109\/fuzz62266.2025.11197675","DOI":"10.1109\/fuzz62266.2025.11197675"},{"key":"23_CR4","doi-asserted-by":"publisher","unstructured":"Daudjee, K., Kamali, S., L\u00f3pez-Ortiz, A.: On the online fault-tolerant server consolidation problem. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014, pp. 12\u201321. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2612669.2612686","DOI":"10.1145\/2612669.2612686"},{"key":"23_CR5","doi-asserted-by":"publisher","unstructured":"D\u00f3sa, G., Sgall, J.: First fit bin packing: a tight analysis. In: Portier, N., Wilke, T. (eds.) 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a020, pp. 538\u2013549. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2013). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2013.538","DOI":"10.4230\/LIPIcs.STACS.2013.538"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-662-43948-7_36","volume-title":"Automata, Languages, and Programming","author":"G D\u00f3sa","year":"2014","unstructured":"D\u00f3sa, G., Sgall, J.: Optimal analysis of best fit bin packing. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 429\u2013441. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_36"},{"issue":"4","key":"23_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299\u2013325 (1974). https:\/\/doi.org\/10.1137\/0203025","journal-title":"SIAM J. Comput."},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-93043-1_1","volume-title":"Algorithmic Aspects of Cloud Computing","author":"S Kamali","year":"2021","unstructured":"Kamali, S., Nikbakht, P.: On the fault-tolerant online bin packing problem. In: D\u2019Angelo, G., Michail, O. (eds.) ALGOCLOUD 2021. LNCS, vol. 13084, pp. 1\u201317. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93043-1_1"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J. ACM 32(3), 562\u2013572 (1985). https:\/\/doi.org\/10.1145\/3828.3833","journal-title":"J. ACM"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.dcan.2024.06.007","volume":"11","author":"B Li","year":"2025","unstructured":"Li, B., et al.: Algorithms for online fault tolerance server consolidation. Digit. Commun. Netw. 11(2), 514\u2013523 (2025). https:\/\/doi.org\/10.1016\/j.dcan.2024.06.007","journal-title":"Digit. Commun. Netw."},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1109\/tpds.2019.2948327","volume":"31","author":"C Li","year":"2020","unstructured":"Li, C., Tang, X.: On fault-tolerant bin packing for online resource allocation. IEEE Trans. Parallel Distrib. Syst. 31(4), 817\u2013829 (2020). https:\/\/doi.org\/10.1109\/tpds.2019.2948327","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Malik, S., Huet, F.: Adaptive fault tolerance in real time cloud computing. In: 2011 IEEE World Congress on Services, pp. 280\u2013287. IEEE, Washington (2011). https:\/\/doi.org\/10.1109\/services.2011.108","DOI":"10.1109\/services.2011.108"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Marzolla, M., Babaoglu, O., Panzieri, F.: Server consolidation in clouds through gossiping. In: 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp.\u00a01\u20136. IEEE, Lucca (2011). https:\/\/doi.org\/10.1109\/wowmom.2011.5986483","DOI":"10.1109\/wowmom.2011.5986483"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1109\/tnet.2016.2630052","volume":"25","author":"R Ren","year":"2017","unstructured":"Ren, R., Tang, X., Li, Y., Cai, W.: Competitiveness of dynamic bin packing for online cloud server allocation. ACM Trans. Network. 25(3), 1324\u20131331 (2017). https:\/\/doi.org\/10.1109\/tnet.2016.2630052","journal-title":"ACM Trans. Network."},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Schaffner, J., et al.: RTP: robust tenant placement for elastic in-memory database clusters. In: Luo, M., Zhang, L.J. (eds.) Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, pp. 773\u2013784. ACM, New York (2013). https:\/\/doi.org\/10.1145\/2463676.2465302","DOI":"10.1145\/2463676.2465302"},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/tsc.2010.25","volume":"3","author":"B Speitkamp","year":"2010","unstructured":"Speitkamp, B., Bichler, M.: A mathematical programming approach for server consolidation problems in virtualized data centers. IEEE Trans. Serv. Comput. 3(4), 266\u2013278 (2010). https:\/\/doi.org\/10.1109\/tsc.2010.25","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1109\/tsc.2011.42","volume":"5","author":"Z Zheng","year":"2012","unstructured":"Zheng, Z., Zhou, T.C., Lyu, M.R., King, I.: Component ranking for fault-tolerant cloud applications. IEEE Trans. Serv. Comput. 5(4), 540\u2013550 (2012). https:\/\/doi.org\/10.1109\/tsc.2011.42","journal-title":"IEEE Trans. Serv. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-3309-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:08:39Z","timestamp":1784066919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-3309-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,15]]},"ISBN":["9789819233083","9789819233090"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-3309-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,15]]},"assertion":[{"value":"15 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/event.ntu.edu.sg\/cocoon2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}