{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:42:44Z","timestamp":1743028964109,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_34","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"461-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Fischer","sequence":"first","affiliation":[]},{"given":"Heiko","family":"R\u00f6glin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.dam.2003.05.006","volume":"143","author":"L Babel","year":"2004","unstructured":"Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Appl. Math. 143, 238\u2013251 (2004)","journal-title":"Discrete Appl. Math."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Levin, A.: Lower bounds for several online variants of bin packing. CoRR, abs\/1708.03228 (2017)","DOI":"10.1007\/978-3-319-89441-6_9"},{"key":"34_CR3","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Levin, A.: Online bin packing with cardinality constraints resolved. In: Proceedings of the 25th European Symposium on Algorithms (ESA), vol. 87, pp. 10:1\u201310:14 (2017)"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2014.06.029","volume":"556","author":"MG Christ","year":"2014","unstructured":"Christ, M.G., Favrholdt, L.M., Larsen, K.S.: Online bin covering: expectations vs. guarantees. Theoret. Comput. Sci. 556, 71\u201384 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR5","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":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/s00224-008-9129-7","volume":"46","author":"L Epstein","year":"2010","unstructured":"Epstein, L., Imreh, C., Levin, A.: Class constrained bin covering. Theory Comput. Syst. 46(2), 246\u2013260 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"34\u201336","key":"34_CR7","doi-asserted-by":"publisher","first-page":"3073","DOI":"10.1016\/j.tcs.2010.04.037","volume":"411","author":"L Epstein","year":"2010","unstructured":"Epstein, L., Imreh, C., Levin, A.: Class constrained bin packing revisited. Theoret. Comput. Sci. 411(34\u201336), 3073\u20133089 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-662-49529-2_35","volume-title":"LATIN 2016: Theoretical Informatics","author":"C Fischer","year":"2016","unstructured":"Fischer, C., R\u00f6glin, H.: Probabilistic analysis of the dual next-fit algorithm for bin covering. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 469\u2013482. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49529-2_35"},{"issue":"14","key":"34_CR9","doi-asserted-by":"publisher","first-page":"2810","DOI":"10.1016\/j.dam.2007.11.004","volume":"156","author":"EG Coffman Jr","year":"2008","unstructured":"Coffman Jr., E.G., Csirik, J., R\u00f3nyai, L., Zsb\u00e1n, A.: Random-order bin packing. Discrete Appl. Math. 156(14), 2810\u20132816 (2008)","journal-title":"Discrete Appl. Math."},{"key":"34_CR10","unstructured":"Kenyon, C.: Best-fit bin-packing with random order. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 359\u2013364 (1996)"},{"issue":"4","key":"34_CR11","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/321906.321917","volume":"22","author":"KL Krause","year":"1975","unstructured":"Krause, K.L., Shen, V., Schwetman, H.D.: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J. ACM 22(4), 522\u2013550 (1975)","journal-title":"J. ACM"},{"issue":"3","key":"34_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(3), 562\u2013572 (1985)","journal-title":"J. ACM"},{"issue":"6","key":"34_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jos.86","volume":"4","author":"H Shachnai","year":"2001","unstructured":"Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. J. Sched. 4(6), 313\u2013338 (2001)","journal-title":"J. Sched."},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2003.05.006","volume":"321","author":"H Shachnai","year":"2004","unstructured":"Shachnai, H., Tamir, T.: Tight bounds for online class-constrained packing. Theoret. Comput. Sci. 321(1), 103\u2013123 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR15","unstructured":"Ullman, J.D.: The Performance of a Memory Allocation Algorithm. Technical report 100 (Princeton University, Department of Electrical Engineering, Computer Sciences Laboratory). Princeton University (1971)"},{"issue":"1\u20133","key":"34_CR16","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.tcs.2008.01.001","volume":"393","author":"EC Xavier","year":"2008","unstructured":"Xavier, E.C., Miyazawa, F.K.: The class constrained bin packing problem with applications to video-on-demand. Theoret. Comput. Sci. 393(1\u20133), 240\u2013259 (2008)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:03:13Z","timestamp":1709827393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}