{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T03:52:26Z","timestamp":1754020346908,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_4","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"40-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Online Bin Packing with Advice of Small Size"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Angelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"D\u00fcrr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahin","family":"Kamali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Renault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adi","family":"Ros\u00e9n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/978-3-319-08001-7_12","volume-title":"Approximation and Online Algorithms","author":"A Adamaszek","year":"2014","unstructured":"Adamaszek, A., Renault, M.P., Ros\u00e9n, A., van Stee, R.: Reordering buffer management with advice. In: Kaklamanis, C., Pruhs, K. (eds.) WAOA 2013. LNCS, vol. 8447, pp. 132\u2013143. Springer, Heidelberg (2014)"},{"issue":"3","key":"4_CR2","first-page":"361","volume":"15","author":"EI \u00c1sgeirsson","year":"2002","unstructured":"\u00c1sgeirsson, E.I., Ayesta, U., Coffman, E.G., Etra, J., Momcilovic, P., Phillips, D.J., Vokhshoori, V., Wang, Z., Wolfe, J.: Closed on-line bin packing. Acta Cybernetica 15(3), 361\u2013367 (2002)","journal-title":"Acta Cybernetica"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.017","volume":"440\u2013441","author":"J Balogh","year":"2012","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theoretical Computer Science 440\u2013441, 1\u201313 (2012)","journal-title":"Theoretical Computer Science"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2014.06.006","volume":"554","author":"H B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H., Hromkovic, J., Komm, D., Krug, S., Smula, J., Sprock, A.: The string guessing problem as a method to prove lower bounds on the advice complexity. Theoretical Computer Science 554, 95\u2013108 (2014)","journal-title":"Theoretical Computer Science"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2014.01.027","volume":"527","author":"H B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H., Komm, D., Kr\u00e1lovic, R., Rossmanith, P.: The online knapsack problem: Advice and randomization. Theoretical Computer Science 527, 61\u201372 (2014)","journal-title":"Theoretical Computer Science"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-22006-7_18","volume-title":"Automata, Languages and Programming","author":"HJ B\u00f6ckenhauer","year":"2011","unstructured":"B\u00f6ckenhauer, H.J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: On the advice complexity of the $$k$$-server problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 207\u2013218. Springer, Heidelberg (2011)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-10631-6_35","volume-title":"Algorithms and Computation","author":"H-J B\u00f6ckenhauer","year":"2009","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the advice complexity of online problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 331\u2013340. Springer, Heidelberg (2009)"},{"key":"4_CR8","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-319-04921-2_17","volume-title":"Language and Automata Theory and Applications","author":"J Boyar","year":"2014","unstructured":"Boyar, J., Kamali, S., Larsen, K.S., L\u00f3pez-Ortiz, A.: On the list update problem with advice. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 210\u2013221. Springer, Heidelberg (2014)"},{"key":"4_CR10","unstructured":"Boyar, J., Kamali, S., Larsen, K.S., L\u00f3pez-Ortiz, A.: Online bin packing with advice. In: Proc. 31st Symp. on Theoretical Aspects of Computer Science (STACS), pp. 174\u2013186 (2014)"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1051\/ita\/2009012","volume":"43","author":"S Dobrev","year":"2009","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: Measuring the problem-relevant information in input. RAIRO - Theoretical Informatics and Applications 43(3), 585\u2013613 (2009)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"issue":"24","key":"4_CR12","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Y Emek","year":"2011","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: Online computation with advice. Theoretical Computer Science 412(24), 2642\u20132656 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1137\/060666329","volume":"19","author":"L Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: On bin packing with conflicts. SIAM J. Optimization 19(3), 1270\u20131298 (2008)","journal-title":"SIAM J. Optimization"},{"key":"4_CR14","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 online bin packing. Computing 49, 329\u2013338 (1993)","journal-title":"Computing"},{"issue":"5","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1137\/S0097539799180408","volume":"30","author":"G Gambosi","year":"2000","unstructured":"Gambosi, G., Postiglione, A., Talamo, M.: Algorithms for the relaxed online bin-packing model. SIAM J. Computing 30(5), 1532\u20131551 (2000)","journal-title":"SIAM J. Computing"},{"key":"4_CR16","unstructured":"Grove, E.F.: Online bin packing with lookahead. In: Proc. 6th Symp. on Discrete Algorithms (SODA), pp. 430\u2013436 (1995)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"256","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. Computing 3, 256\u2013278 (1974)","journal-title":"SIAM J. Computing"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1051\/ita\/2011105","volume":"45","author":"D Komm","year":"2011","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R.: Advice complexity and barely random algorithms. RAIRO - Theoretical Informatics and Applications 45(2), 249\u2013267 (2011)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00224-012-9434-z","volume":"56","author":"MP Renault","year":"2015","unstructured":"Renault, M.P., Ros\u00e9n, A.: On online algorithms with advice for the k-server problem. Theory of Computing Systems 56(1), 3\u201321 (2015)","journal-title":"Theory of Computing Systems"},{"key":"4_CR20","unstructured":"Renault, M.P., Ros\u00e9n, A., van Stee, R.: Online algorithms with advice for bin packing and scheduling problems. CoRR abs\/1311.7589 (2013)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"SS Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. Journal of the ACM 49, 640\u2013671 (2002)","journal-title":"Journal of the ACM"}],"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-319-21840-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:35:04Z","timestamp":1675272904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}