{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:49:23Z","timestamp":1780822163746,"version":"3.54.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T00:00:00Z","timestamp":1377561600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s00453-013-9822-z","type":"journal-article","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T08:17:44Z","timestamp":1377591464000},"page":"76-91","source":"Crossref","is-referenced-by-count":26,"title":["Online Unweighted Knapsack Problem with Removal Cost"],"prefix":"10.1007","volume":"70","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yasushi","family":"Kawase","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,27]]},"reference":[{"key":"9822_CR1","series-title":"Lecture Notes in Computer Science","first-page":"379","volume-title":"Automata, Language and Programming","author":"B.V. Ashwinkumar","year":"2011","unstructured":"Ashwinkumar, B.V.: Buyback problem - approximate matroid intersection with cancellation costs. In: Automata, Language and Programming. Lecture Notes in Computer Science, vol. 6755, pp. 379\u2013390. Springer, Berlin (2011)"},{"key":"9822_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Internet and Network Economics. Lecture Notes in Computer Science, vol. 5929, pp. 529\u2013536. Springer, Berlin (2009)"},{"key":"9822_CR3","volume-title":"Proceedings of the 4th Workshop on Ad Auctions","author":"M. Babaioff","year":"2008","unstructured":"Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling banner ads: online algorithms with buyback. In: Proceedings of the 4th Workshop on Ad Auctions (2008)"},{"key":"9822_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/1566374.1566383","volume-title":"Proceedings of the 10th ACM Conference on Electronic Commerce","author":"M. Babaioff","year":"2009","unstructured":"Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling ad campaigns: online algorithms with cancellations. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 61\u201370 (2009)"},{"issue":"4","key":"9822_CR5","doi-asserted-by":"crossref","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. Mark. Sci. 18(4), 605\u2013610 (1999)","journal-title":"Mark. Sci."},{"key":"9822_CR6","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1137\/1.9781611973068.137","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"F. Constantin","year":"2009","unstructured":"Constantin, F., Feldman, J., Muthukrishnan, S., P\u00e1l, M.: An online mechanism for ad slot reservations with cancellations. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1265\u20131274 (2009)"},{"key":"9822_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Approximation and Online Algorithms. Lecture Notes in Computer Science, vol. 5893, pp. 182\u2013193. Springer, Berlin (2010)"},{"key":"9822_CR8","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 411, 3956\u20133964 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9822_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 2380, pp. 293\u2013305. Springer, Berlin (2002)"},{"key":"9822_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science, vol. 4627, pp. 180\u2013188. Springer, Berlin (2007)"},{"key":"9822_CR11","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, Berlin (2004)"},{"issue":"2","key":"9822_CR12","doi-asserted-by":"crossref","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 29(2), 277\u2013305 (1998)","journal-title":"J. Algorithms"},{"key":"9822_CR13","first-page":"73","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Math. Program. 68, 73\u2013104 (1995)","journal-title":"Math. Program."},{"key":"9822_CR14","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/ISPAN.2005.19","volume-title":"Proceedings of 8th International Symposium on Parallel Architectures, Algorithms and Networks","author":"J. Noga","year":"2005","unstructured":"Noga, J., Sarbua, V.: An online partially fractional knapsack problem. In: Proceedings of 8th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 108\u2013112 (2005)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9822-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9822-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9822-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:12Z","timestamp":1559137512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9822-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,27]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["9822"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9822-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,27]]}}}