{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:57Z","timestamp":1759637997638,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_41","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"435-445","source":"Crossref","is-referenced-by-count":4,"title":["Unit Cost Buyback Problem"],"prefix":"10.1007","author":[{"given":"Yasushi","family":"Kawase","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_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":"A. Badanidiyuru Varadaraja","year":"2011","unstructured":"Badanidiyuru Varadaraja, A.: Buyback problem - approximate matroid intersection with cancellation costs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 379\u2013390. Springer, Heidelberg (2011)"},{"key":"41_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":"41_CR3","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":"41_CR4","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":"41_CR5","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":"41_CR6","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":"41_CR7","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":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-38756-2_9","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"X. Han","year":"2013","unstructured":"Han, X., Kawase, Y., Makino, K.: Randomized algorithms for removable online knapsack problems. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol.\u00a07924, pp. 60\u201371. Springer, Heidelberg (2013)"},{"key":"41_CR9","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":"41_CR10","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":"41_CR11","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":"41_CR12","doi-asserted-by":"crossref","unstructured":"Iwama, K., Zhang, G.: Optimal resource augmentations for online knapsack. In: APPROX-RANDOM, pp. 180\u2013188 (2007)","DOI":"10.1007\/978-3-540-74208-1_13"},{"key":"41_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","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:24:45Z","timestamp":1746073485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}