{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:43:39Z","timestamp":1767339819201,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_1","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Online Bin Packing with Overload Cost"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2006-0601","authenticated-orcid":false,"given":"Kelin","family":"Luo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2547-3782","authenticated-orcid":false,"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"1_CR1","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, 20\u201322 August 2018, Helsinki, Finland. LIPIcs, vol. 112, pp. 5:1\u20135:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-39479-0_2","volume-title":"Approximation and Online Algorithms","author":"J Balogh","year":"2020","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. In: Bampis, E., Megow, N. (eds.) WAOA 2019. LNCS, vol. 11926, pp. 18\u201328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39479-0_2"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2018.11.005","volume":"102","author":"J Balogh","year":"2019","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Sgall, J., van Stee, R.: The optimal absolute ratio for online bin packing. J. Comput. Syst. Sci. 102, 1\u201317 (2019)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10951-006-5594-5","volume":"9","author":"E Coffman","year":"2006","unstructured":"Coffman, E., Lueker, G.S.: Approximation algorithms for extensible bin packing. J. Sched. 9(1), 63\u201369 (2006)","journal-title":"J. Sched."},{"issue":"8","key":"1_CR5","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF00289157","volume":"26","author":"J Csirik","year":"1989","unstructured":"Csirik, J.: An on-line algorithm for variable-sized bin packing. Acta Inf. 26(8), 697\u2013709 (1989)","journal-title":"Acta Inf."},{"issue":"1\u20133","key":"1_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(99)00020-7","volume":"94","author":"P Dell\u2019Olmo","year":"1999","unstructured":"Dell\u2019Olmo, P., Speranza, M.G.: Approximation algorithms for partitioning small items in unequal bins to minimize the total size. Discrete Appl. Math. 94(1\u20133), 181\u2013191 (1999)","journal-title":"Discrete Appl. Math."},{"key":"1_CR7","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). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)"},{"key":"1_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"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ipl.2008.08.005","volume":"109","author":"L Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. Inf. Process. Lett. 109(1), 32\u201337 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"1_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-010-0403-5","volume":"132","author":"L Epstein","year":"2012","unstructured":"Epstein, L., Levin, A.: Bin packing with general cost structures. Math. Program. 132(1\u20132), 355\u2013391 (2012)","journal-title":"Math. Program."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jcss.2016.07.007","volume":"84","author":"L Epstein","year":"2017","unstructured":"Epstein, L., Levin, A.: An AFPTAS for variable sized bin packing with general activation costs. J. Comput. Syst. Sci. 84, 79\u201396 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A.J., 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)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0166-218X(88)90089-3","volume":"22","author":"NG Kinnersley","year":"1989","unstructured":"Kinnersley, N.G., Langston, M.A.: Online variable-sized bin packing. Discrete Appl. Math. 22(2), 143\u2013148 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1002\/nav.20142","volume":"53","author":"CL Li","year":"2006","unstructured":"Li, C.L., Chen, Z.L.: Bin-packing problem with concave costs of bin utilization. Naval Res. Logist. (NRL) 53(4), 298\u2013308 (2006)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1137\/S0895480100369948","volume":"14","author":"SS Seiden","year":"2001","unstructured":"Seiden, S.S.: An optimal online algorithm for bounded space variable-sized bin packing. SIAM J. Discrete Math. 14(4), 458\u2013470 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-319-08019-2_38","volume-title":"Language, Life, Limits","author":"J Sgall","year":"2014","unstructured":"Sgall, J.: Online bin packing: old algorithms and new results. In: Beckmann, A., Csuhaj-Varj\u00fa, E., Meer, K. (eds.) CiE 2014. LNCS, vol. 8493, pp. 362\u2013372. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08019-2_38"},{"key":"1_CR17","unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Technical report 100, Princeton University, Prinston, NJ (1971)"},{"issue":"5","key":"1_CR18","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1287\/opre.51.5.759.16753","volume":"51","author":"J Yang","year":"2003","unstructured":"Yang, J., Leung, J.Y.: The ordered open-end bin-packing problem. Oper. Res. 51(5), 759\u2013770 (2003)","journal-title":"Oper. Res."},{"issue":"1","key":"1_CR19","first-page":"141","volume":"11","author":"D Ye","year":"2009","unstructured":"Ye, D., Zhang, G.: On-line extensible bin packing with unequal bin sizes. Discret. Math. Theor. Comput. Sci. 11(1), 141\u2013152 (2009)","journal-title":"Discret. Math. Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:06:14Z","timestamp":1611792374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","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":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"0","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":"48% - 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":"2,8","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":"2,21","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)"}}]}}