{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:26Z","timestamp":1759637606788,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_6","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T15:12:12Z","timestamp":1344870732000},"page":"61-73","source":"Crossref","is-referenced-by-count":6,"title":["Online Knapsack Problem with Removal Cost"],"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":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-22006-7_32","volume-title":"Automata, Languages and Programming","author":"B.V. Ashwinkumar","year":"2011","unstructured":"Ashwinkumar, B.V.: Buyback Problem - Approximate Matroid Intersection with Cancellation Costs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 379\u2013390. Springer, Heidelberg (2011)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-642-10841-9_52","volume-title":"Internet and Network Economics","author":"B.V. Ashwinkumar","year":"2009","unstructured":"Ashwinkumar, B.V., Kleinberg, R.: Randomized Online Algorithms for the Buyback Problem. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 529\u2013536. Springer, Heidelberg (2009)"},{"key":"6_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"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1287\/mksc.18.4.605","volume":"18","author":"E. Biyalogorsky","year":"1999","unstructured":"Biyalogorsky, E., Carmon, Z., Fruchter, G.E., Gerstner, E.: Research note: Overselling with opportunistic cancellations. Marketing Science\u00a018(4), 605\u2013610 (1999)","journal-title":"Marketing Science"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Constantin, F., Feldman, J., Muthukrishnan, S., P\u00e1l, M.: An online mechanism for ad slot reservations with cancellations. In: SODA, pp. 1265\u20131274 (2009)","DOI":"10.1137\/1.9781611973068.137"},{"key":"6_CR6","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":"6_CR7","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":"6_CR8","doi-asserted-by":"crossref","unstructured":"Iwama, K., Taketomi, S.: Removable online knapsack problems. LNCS, pp. 293\u2013305 (2002)","DOI":"10.1007\/3-540-45465-9_26"},{"key":"6_CR9","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":"6_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":"6_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. Journal of Algorithms\u00a029(2), 277\u2013305 (1998)","journal-title":"Journal of Algorithms"},{"key":"6_CR12","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":"6_CR13","doi-asserted-by":"crossref","unstructured":"Noga, J., Sarbua, V.: An online partially fractional knapsack problem. In: ISPAN, pp. 108\u2013112 (2005)","DOI":"10.1109\/ISPAN.2005.19"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T21:08:51Z","timestamp":1743973731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}