{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:53:49Z","timestamp":1775289229338,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T00:00:00Z","timestamp":1543449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T00:00:00Z","timestamp":1543449600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JST, ERATO, Kawarabayashi Large Graph Project"},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["KAKENHI 26887014"],"award-info":[{"award-number":["KAKENHI 26887014"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council, University Grants Committee, Hong Kong","award":["HKU716412"],"award-info":[{"award-number":["HKU716412"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11571060"],"award-info":[{"award-number":["11571060"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["KAKENHI JP24106002"],"award-info":[{"award-number":["KAKENHI JP24106002"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP25280004"],"award-info":[{"award-number":["JP25280004"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP26280001"],"award-info":[{"award-number":["JP26280001"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJCR1402"],"award-info":[{"award-number":["JPMJCR1402"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00224-018-9897-7","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T23:23:51Z","timestamp":1543447431000},"page":"1185-1206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unit Cost Buyback Problem"],"prefix":"10.1007","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5626-779X","authenticated-orcid":false,"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","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"key":"9897_CR1","doi-asserted-by":"crossref","unstructured":"Ashwinkumar, B.V.: Buyback problem - approximate matroid intersection with cancellation costs. In: Proceedings of the 38th International Colloquium on Automata, Language and Programming, pp. 379\u2013390 (2011)","DOI":"10.1007\/978-3-642-22006-7_32"},{"key":"9897_CR2","doi-asserted-by":"crossref","unstructured":"Ashwinkumar, B.V., Kleinberg, R.: Randomized online algorithms for the buyback problem. In: Internet and network economics, pp. 529\u2013536 (2009)","DOI":"10.1007\/978-3-642-10841-9_52"},{"key":"9897_CR3","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":"9897_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Hartline, J.D., Kleinberg, R. D.: Selling ad campaigns: online algorithms with cancel- lations. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 61\u201370 (2009)","DOI":"10.1145\/1566374.1566383"},{"issue":"4","key":"9897_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. Mark. Sci. 18(4), 605\u2013610 (1999)","journal-title":"Mark. Sci."},{"key":"9897_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: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1265\u20131274 (2009)","DOI":"10.1137\/1.9781611973068.137"},{"key":"9897_CR7","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.disopt.2017.07.002","volume":"26","author":"S Fukuda","year":"2017","unstructured":"Fukuda, S., Shioura, A., Tokuyama, T.: Buyback problem with discrete concave valuation functions. Discret. Optim. 26, 78\u201396 (2017)","journal-title":"Discret. Optim."},{"key":"9897_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s00453-013-9822-z","volume":"70","author":"X Han","year":"2014","unstructured":"Han, X., Kawase, Y., Makino, K.: Online unweighted knapsack problem with removal cost. Algorithmica 70, 76\u201391 (2014)","journal-title":"Algorithmica"},{"key":"9897_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.tcs.2014.10.017","volume":"562","author":"X Han","year":"2015","unstructured":"Han, X., Kawase, Y., Makino, K.: Randomized algorithms for online knapsack problems. Theor. Comput. Sci. 562, 395\u2013405 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"9897_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2013.09.013","volume":"540\u20135419","author":"X Han","year":"2014","unstructured":"Han, X., Kawase, Y., Makino, K., Guo, H.: Online knapsack problem under convex function. Theor. Comput. Sci. 540\u20135419, 62\u201369 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"9897_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.tcs.2015.09.021","volume":"609","author":"X Han","year":"2016","unstructured":"Han, X., Makino, K.: Online minimization knapsack problem. Theor. Comput. Sci. 609, 185\u2013196 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"9897_CR12","doi-asserted-by":"crossref","unstructured":"Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Proceeding of the 29th International Colloquium on Automata, Languages and Programming, pp. 293\u2013305 (2002)","DOI":"10.1007\/3-540-45465-9_26"},{"key":"9897_CR13","doi-asserted-by":"crossref","unstructured":"Iwama, K., Zhang, G.: Optimal resource augmentations for online knapsack. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 180\u2013188 (2007)","DOI":"10.1007\/978-3-540-74208-1_13"},{"key":"9897_CR14","doi-asserted-by":"crossref","unstructured":"Kawase, Y., Han, X., Makino, K.: Unit cost buyback problem. In: Proceedings of the 24th International Symposium on Algorithms and Computation, pp. 435\u2013445 (2013)","DOI":"10.1007\/978-3-642-45030-3_41"},{"key":"9897_CR15","doi-asserted-by":"crossref","unstructured":"Kawase, Y., Han, X., Makino, K.: Proportional cost buyback problem with weight bounds. Theoretical Computer Science (2016)","DOI":"10.1007\/978-3-319-26626-8_59"},{"key":"9897_CR16","doi-asserted-by":"crossref","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)","DOI":"10.1109\/ISPAN.2005.19"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9897-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-018-9897-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9897-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:00:31Z","timestamp":1775286031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-018-9897-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,29]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["9897"],"URL":"https:\/\/doi.org\/10.1007\/s00224-018-9897-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,29]]},"assertion":[{"value":"29 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}