{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:27:47Z","timestamp":1742934467512,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_35","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"394-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A 4-Space Bounded Approximation Algorithm for\u00a0Online Bin Packing Problem"],"prefix":"10.1007","author":[{"given":"Sizhe","family":"Li","sequence":"first","affiliation":[]},{"given":"Jinghui","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Mingming","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kun","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: 26th Annual European Symposium on Algorithms, ESA 2018, 20\u201322 August 2018, Helsinki, Finland, vol. 112, pp. 5:1\u20135:14 (2018)","key":"35_CR1"},{"issue":"7","key":"35_CR2","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1007\/s00453-021-00818-7","volume":"83","author":"J Balogh","year":"2021","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. Algorithmica 83(7), 2047\u20132062 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00818-7","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Sgall, J., van Stee, R.: The optimal absolute ratio for online bin packing. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4\u20136 January 2015, pp. 1425\u20131438 (2015)","key":"35_CR3","DOI":"10.1137\/1.9781611973730.94"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-23719-5_23","volume-title":"Algorithms \u2013 ESA 2011","author":"M Chrobak","year":"2011","unstructured":"Chrobak, M., Sgall, J., Woeginger, G.J.: Two-bounded-space bin packing revisited. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 263\u2013274. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_23"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00453-001-0041-7","volume":"31","author":"J Csirik","year":"2001","unstructured":"Csirik, J., Johnson, D.S.: Bounded space on-line bin packing: best is better than first. Algorithmica 31, 115\u2013138 (2001). https:\/\/doi.org\/10.1007\/s00453-001-0041-7","journal-title":"Algorithmica"},{"key":"35_CR6","first-page":"89","volume":"9","author":"J Csirik","year":"1989","unstructured":"Csirik, J., Imreh, B.: On the worst-case performance of the NkF bin-packing heuristic. Acta Cybernet. 9, 89\u2013105 (1989)","journal-title":"Acta Cybernet."},{"unstructured":"D\u00f3sa, G., Sgall, J.: First fit bin packing: a tight analysis. In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, 27 February\u20132 March 2013, Kiel, Germany, vol. 20, pp. 538\u2013549 (2013)","key":"35_CR7"},{"key":"35_CR8","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"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02248693","volume":"49","author":"G Galambos","year":"1993","unstructured":"Galambos, G., Woeginger, G.J.: Repacking helps in bounded space on-line bind-packing. Computing 49, 329\u2013338 (1993). https:\/\/doi.org\/10.1007\/BF02248693","journal-title":"Computing"},{"doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Ullman, J.D.: Worst-case analysis of memory allocation algorithms. In: Proceedings of the 4th Annual ACM Symposium on Theory of Computing, STOC 1972, 1\u20133 May 1972, Denver, Colorado, USA, pp. 143\u2013150 (1972)","key":"35_CR10","DOI":"10.1145\/800152.804907"},{"unstructured":"Johnson, D.S.: Near-optimal bin packing algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973)","key":"35_CR11"},{"key":"35_CR12","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, 562\u2013572 (1985)","journal-title":"J. ACM"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/0222004","volume":"22","author":"W Mao","year":"1993","unstructured":"Mao, W.: Tight worst-case performance bounds for next-k-fit bin packing. SIAM J. Comput. 22, 46\u201356 (1993)","journal-title":"SIAM J. Comput."},{"unstructured":"Ullman, J.: The performance of a memory allocation algorithm. Technical Report, Princeton University (1971)","key":"35_CR14"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0167-6377(99)00077-2","volume":"26","author":"G Zhang","year":"2000","unstructured":"Zhang, G., Cai, X., Wong, C.K.: Linear time-approximation algorithms for bin packing. Oper. Res. Lett. 26, 217\u2013222 (2000)","journal-title":"Oper. Res. Lett."}],"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-3-031-22105-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T09:37:21Z","timestamp":1728639441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","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":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}