{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:52:48Z","timestamp":1725583968150},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_9","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"60-71","source":"Crossref","is-referenced-by-count":5,"title":["Randomized Algorithms for Removable Online Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasushi","family":"Kawase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74208-1_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Babaioff","year":"2007","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: A knapsack secretary problem with applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 16\u201328. Springer, Heidelberg (2007)"},{"key":"9_CR2","unstructured":"Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling banner ads: Online algorithms with buyback. In: Proceedings of 4th Workshop on Ad Auctions (2008)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling ad campaigns: Online algorithms with cancellations. In: ACM Conference on Electronic Commerce, pp. 61\u201370 (2009)","DOI":"10.1145\/1566374.1566383"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11561071_61","volume-title":"Algorithms \u2013 ESA 2005","author":"N. Buchbinder","year":"2005","unstructured":"Buchbinder, N., Naor, J(S.): Online primal-dual algorithms for covering and packing problems. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 689\u2013701. Springer, Heidelberg (2005)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.: Improved bounds for online routing and packing via a primal-dual approach. In: Foundations of Computer Science, pp. 293\u2013304 (2006)","DOI":"10.1109\/FOCS.2006.39"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-32241-9_6","volume-title":"Computing and Combinatorics","author":"X. Han","year":"2012","unstructured":"Han, X., Kawase, Y., Makino, K.: Online knapsack problem with removal cost. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 61\u201373. Springer, Heidelberg (2012)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-12450-1_17","volume-title":"Approximation and Online Algorithms","author":"X. Han","year":"2010","unstructured":"Han, X., Makino, K.: Online minimization knapsack problem. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 182\u2013193. Springer, Heidelberg (2010)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"3956","DOI":"10.1016\/j.tcs.2010.08.009","volume":"411","author":"X. Han","year":"2010","unstructured":"Han, X., Makino, K.: Online removable knapsack with limited cuts. Theoretical Computer Science\u00a0411, 3956\u20133964 (2010)","journal-title":"Theoretical Computer Science"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-29952-0_17","volume-title":"Theory and Applications of Models of Computation","author":"H. Ito","year":"2012","unstructured":"Ito, H., Kiyoshima, S., Yoshida, Y.: Constant-time approximation algorithms for the knapsack problem. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol.\u00a07287, pp. 131\u2013142. Springer, Heidelberg (2012)"},{"key":"9_CR10","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)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-74208-1_13","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K. Iwama","year":"2007","unstructured":"Iwama, K., Zhang, G.: Optimal resource augmentations for online knapsack. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 180\u2013188. Springer, Heidelberg (2007)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0377-2217(99)00157-5","volume":"120","author":"H. Kellerer","year":"2000","unstructured":"Kellerer, H., Mansini, R., Speranza, M.G.: Two linear approximation algorithms for the subset-sum problem. European Journal of Operational Research\u00a0120, 289\u2013296 (2000)","journal-title":"European Journal of Operational Research"},{"key":"9_CR13","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":"9_CR14","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. Journal of Algorithms\u00a029(2), 277\u2013305 (1998)","journal-title":"Journal of Algorithms"},{"key":"9_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"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.: Probabilistic computations: Toward a unified measure of complexity. In: 18th Annual Symposium on Foundations of Computer Science, pp. 222\u2013227. IEEE (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:23:53Z","timestamp":1557717833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}