{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:04:30Z","timestamp":1786979070692,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642293436","type":"print"},{"value":"9783642293443","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_6","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T10:19:29Z","timestamp":1334053169000},"page":"61-72","source":"Crossref","is-referenced-by-count":24,"title":["On the Advice Complexity of the Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Hans-Joachim","family":"B\u00f6ckenhauer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dennis","family":"Komm","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Rossmanith","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","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":"H.-J. 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. LNCS, vol.\u00a06755, pp. 207\u2013218. Springer, Heidelberg (2011)"},{"key":"6_CR2","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.\u00a05878, pp. 331\u2013340. Springer, Heidelberg (2009)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Rossmanith, P.: On the advice complexity of the knapsack problem. Technical Report 740, ETH Zurich (2011)","DOI":"10.1007\/978-3-642-22006-7_18"},{"key":"6_CR4","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0196-6774(02)00202-X","volume":"44","author":"J. Csirik","year":"2002","unstructured":"Csirik, J., Woeginger, G.J.: Resource augmentation for online bounded space bin packing. Journal of Algorithms\u00a044(2), 308\u2013320 (2002)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"6_CR6","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. Theoretical Informatics and Applications (RAIRO)\u00a043(3), 585\u2013613 (2009)","journal-title":"Theoretical Informatics and Applications (RAIRO)"},{"issue":"24","key":"6_CR7","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\u00a0412(24), 2642\u20132656 (2011)","journal-title":"Theoretical Computer Science"},{"key":"6_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05269-3","volume-title":"Algorithmics for Hard Problems","author":"J. Hromkovi\u010d","year":"2004","unstructured":"Hromkovi\u010d, J.: Algorithmics for Hard Problems, 2nd edn. Springer, Heidelberg (2004)","edition":"2"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-15155-2_3","volume-title":"Mathematical Foundations of Computer Science 2010","author":"J. Hromkovi\u010d","year":"2010","unstructured":"Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: Information Complexity of Online Problems. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 24\u201336. Springer, Heidelberg (2010)"},{"issue":"22","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1016\/j.ipl.2010.08.013","volume":"110","author":"K. Iwama","year":"2010","unstructured":"Iwama, K., Zhang, G.: Online knapsack with resource augmentation. Information Processing Letters\u00a0110(22), 1016\u20131020 (2010)","journal-title":"Information Processing Letters"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM\u00a047(4), 617\u2013643 (2000)","journal-title":"Journal of the ACM"},{"key":"6_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Springer, Heidelberg (2004)"},{"issue":"2","key":"6_CR13","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. Theoretical Informatics and Applications (RAIRO)\u00a045(2), 249\u2013267 (2011)","journal-title":"Theoretical Informatics and Applications (RAIRO)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the advice complexity of the set cover problem. Technical Report 738, ETH Zurich (2011)","DOI":"10.1007\/978-3-642-30642-6_23"},{"key":"6_CR15","first-page":"73","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Mathematical Programming\u00a068, 73\u2013104 (1995)","journal-title":"Mathematical Programming"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"C.A. Phillips","year":"2002","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica\u00a032(2), 163\u2013200 (2002)","journal-title":"Algorithmica"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-540-92185-1_63","volume-title":"Internet and Network Economics","author":"Y. Zhou","year":"2008","unstructured":"Zhou, Y., Chakrabarty, D., Lukose, R.M.: Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 566\u2013576. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:35:44Z","timestamp":1620113744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}