{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:43Z","timestamp":1759638943748,"version":"3.40.4"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080000"},{"type":"electronic","value":"9783319080017"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08001-7_13","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:53:00Z","timestamp":1402419180000},"page":"144-155","source":"Crossref","is-referenced-by-count":1,"title":["Online Knapsack Revisited"],"prefix":"10.1007","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Je\u017c","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00453-002-0965-6","volume":"34","author":"Y. Azar","year":"2002","unstructured":"Azar, Y., Boyar, J., Favrholdt, L.M., Larsen, K.S., Nielsen, M.N., Epstein, L.: Fair versus unrestricted bin packing. Algorithmica\u00a034(2), 181\u2013196 (2002)","journal-title":"Algorithmica"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-24829-0_4","volume-title":"Algorithmic Game Theory","author":"Y. Azar","year":"2011","unstructured":"Azar, Y., Khaitsin, E.: Prompt mechanism for ad placement over time. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol.\u00a06982, pp. 19\u201330. Springer, Heidelberg (2011)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in online algorithms. Algorithmica\u00a011(1), 2\u201314 (1994)","journal-title":"Algorithmica"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-29344-3_6","volume-title":"LATIN 2012: Theoretical Informatics","author":"H.-J. B\u00f6ckenhauer","year":"2012","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Rossmanith, P.: On the advice complexity of the knapsack problem. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol.\u00a07256, pp. 61\u201372. Springer, Heidelberg (2012)"},{"key":"13_CR5","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Gamzu, I.: Truthful mechanisms via greedy iterative packing. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 56\u201369. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03685-9_5"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45465-9_26","volume-title":"Automata, Languages and Programming","author":"K. Iwama","year":"2002","unstructured":"Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 293\u2013305. Springer, Heidelberg (2002)"},{"issue":"22","key":"13_CR8","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":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0196-6774(03)00074-9","volume":"49","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., Pruhs, K.: Maximizing job completions online. J. of Algorithms\u00a049(1), 63\u201385 (2003)","journal-title":"J. of Algorithms"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Springer (2004)","DOI":"10.1007\/978-3-540-24777-7"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/jagm.1998.0954","volume":"29","author":"G.S. Lueker","year":"1998","unstructured":"Lueker, G.S.: Average-case analysis of off-line and on-line knapsack problems. J. Algorithms\u00a029(2), 277\u2013305 (1998)","journal-title":"J. Algorithms"},{"key":"13_CR12","first-page":"73","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Math. Program.\u00a068, 73\u2013104 (1995)","journal-title":"Math. Program."},{"key":"13_CR13","unstructured":"Martello, S., Toth, P.: Knapsack problems. John Wiley & Sons (1990)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Noga, J., Sarbua, V.: An online partially fractional knapsack problem. In: Proc. of the 8th Int. Symp. on Parallel Architectures, Algorithms, and Networks (ISPAN), pp. 108\u2013112 (2005)","DOI":"10.1109\/ISPAN.2005.19"},{"key":"13_CR15","unstructured":"Sgall, J.: Private communication (2013)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08001-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:05:20Z","timestamp":1746263120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08001-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080000","9783319080017"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08001-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}