{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:11Z","timestamp":1742913671148,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_17","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"225-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online Bin Covering with Advice"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahin","family":"Kamali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"8","key":"17_CR1","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1007\/s00224-018-9862-5","volume":"62","author":"S Angelopoulos","year":"2018","unstructured":"Angelopoulos, S., D\u00fcrr, C., Kamali, S., Renault, M.P., Ros\u00e9n, A.: Online bin packing with advice of small size. Theory Comput. Syst. 62(8), 2006\u20132034 (2018)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"17_CR2","first-page":"361","volume":"15","author":"EI \u00c1sgeirsson","year":"2002","unstructured":"\u00c1sgeirsson, E.I., et al.: Closed on-line bin packing. Acta Cybernetica 15(3), 361\u2013367 (2002)","journal-title":"Acta Cybernetica"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"SF Assmann","year":"1984","unstructured":"Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.-T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5(4), 502\u2013525 (1984)","journal-title":"J. Algorithms"},{"key":"17_CR4","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), volume 112 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 5:1\u20135:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"17_CR5","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. ArXiv, arXiv:1807.05554 [cs:DS] (2018)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-13350-8_20","volume-title":"Computing with New Resources","author":"H-J B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Komm, D.: A technique to obtain hardness results for randomized online algorithms \u2013 a survey. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 264\u2013276. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13350-8_20"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2014.06.006","volume":"554","author":"H-J B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Komm, D., Krug, S., Smula, J., Sprock, A.: The string guessing problem as a method to prove lower bounds on the advice complexity. Theor. Comput. Sci. 554, 95\u2013108 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jcss.2017.01.001","volume":"86","author":"H-J B\u00f6ckenhauer","year":"2017","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovic, R., Kr\u00e1lovic, R.: On the advice complexity of the k-server problem. J. Comput. Syst. Sci. 86, 159\u2013170 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR9","unstructured":"Borodin, A., Pankratov, D., Salehi-Abari, A.: A simple PTAS for the dual bin packing problem and advice complexity of its online version. In: 1st Symposium on Simplicity in Algorithms (SOSA), LIPIcs, pp. 8:1\u20138:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Boyar, J., Favrholdt, L.M., Kamali, S., Larsen, K.S.: Online bin covering with advice. ArXiv, arXiv:1905.00066 [cs:DS] (2019)","DOI":"10.1007\/978-3-030-24766-9_17"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3056461","volume":"50","author":"Joan Boyar","year":"2017","unstructured":"Boyar, J., Favrholdt, L.M., Kudahl, C., Larsen, K.S., Mikkelsen, J.W.: Online algorithms with advice: a survey. ACM Comput. Surv. 50(2), 19:1\u201319:34 (2017)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00453-014-9955-8","volume":"74","author":"J Boyar","year":"2016","unstructured":"Boyar, J., Kamali, S., Larsen, K.S., L\u00f3pez-Ortiz, A.: Online bin packing with advice. Algorithmica 74(1), 507\u2013527 (2016)","journal-title":"Algorithmica"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(88)90052-2","volume":"21","author":"J Csirik","year":"1988","unstructured":"Csirik, J., Totik, V.: Online algorithms for a dual version of bin packing. Discrete Appl. Math. 21(2), 163\u2013167 (1988)","journal-title":"Discrete Appl. Math."},{"key":"17_CR14","unstructured":"D\u00fcrr, C., Konrad, C., Renault, M.P.: On the power of advice and randomization for online bipartite matching. In: 24th Annual European Symposium on Algorithms (ESA), volume 57 of LIPIcs, pp. 37:1\u201337:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"17_CR15","unstructured":"Grove, E.F.: Online bin packing with lookahead. In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, pp. 430\u2013436 (1995)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Hoberg, R., Rothvoss, T.: A logarithmic additive integrality gap for bin packing. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, pp. 2616\u20132625 (2017)","DOI":"10.1137\/1.9781611974782.172"},{"issue":"1\u20133","key":"17_CR17","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0304-3975(03)00363-3","volume":"306","author":"K Jansen","year":"2003","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic fully polynomial time approximation scheme for bin covering. Theoret. Comput. Sci. 306(1\u20133), 543\u2013551 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 312\u2013320. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"17_CR19","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42749-2","volume-title":"An Introduction to Online Computation","author":"Dennis Komm","year":"2016","unstructured":"Komm, D.: An Introduction to Online Computation - Determinism, Randomization, Advice. Texts in Theoretical Computer Science. An EATCS Series. Springer, Switzerland (2016). https:\/\/doi.org\/10.1007\/978-3-319-42749-2"},{"key":"17_CR20","unstructured":"Mikkelsen, J.W.: Randomization can be as helpful as a glimpse of the future in online computation. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 39:1\u201339:14. Springer, Heidelberg (2016)"},{"issue":"4","key":"17_CR21","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1007\/s10100-016-0450-y","volume":"25","author":"MP Renault","year":"2017","unstructured":"Renault, M.P.: Online algorithms with advice for the dual bin packing problem. CEJOR 25(4), 953\u2013966 (2017)","journal-title":"CEJOR"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2015.07.050","volume":"600","author":"MP Renault","year":"2015","unstructured":"Renault, M.P., Ros\u00e9n, A., van Stee, R.: Online algorithms with advice for bin packing and scheduling problems. Theoret. Comput. Sci. 600, 155\u2013170 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Rothvoss, T.: Approximating bin packing within o(log OPT * log log OPT) bins. In: 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 20\u201329. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.11"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:53:34Z","timestamp":1710266014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}