{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:01:32Z","timestamp":1742940092485,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596044"},{"type":"electronic","value":"9783319596051"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59605-1_10","type":"book-chapter","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T15:06:26Z","timestamp":1495465586000},"page":"103-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Knapsack Problem Under Concave Functions"],"prefix":"10.1007","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00224-014-9566-4","volume":"58","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Jez, L., Sgall, J.: Online knapsack revisited. Theory Comput. Syst. 58(1), 153\u2013190 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10_CR2","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(1), 76\u201391 (2014)","journal-title":"Algorithmica"},{"key":"10_CR3","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":"10_CR4","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2013.09.013","volume":"540","author":"X Han","year":"2014","unstructured":"Han, X., Kawase, Y., Makino, K., Guo, H.: Online removable knapsack problem under convex function. Theor. Comput. Sci. 540, 62\u201369 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"44\u201346","key":"10_CR5","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. Theor. Comput. Sci. 411(44\u201346), 3956\u20133964 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR6","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":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11940128_9","volume-title":"Algorithms and Computation","author":"T Horiyama","year":"2006","unstructured":"Horiyama, T., Iwama, K., Kawahara, J.: Finite-state online algorithms and their automated competitive analysis. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 71\u201380. Springer, Heidelberg (2006). doi:10.1007\/11940128_9"},{"key":"10_CR8","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., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 293\u2013305. Springer, Heidelberg (2002). doi:10.1007\/3-540-45465-9_26"},{"key":"10_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.) APPROX\/RANDOM-2007. LNCS, vol. 4627, pp. 180\u2013188. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74208-1_13"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1007\/978-3-319-26626-8_59","volume-title":"Combinatorial Optimization and Applications","author":"Y Kawase","year":"2015","unstructured":"Kawase, Y., Han, X., Makino, K.: Proportional cost buyback problem with weight bounds. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 794\u2013808. Springer, Cham (2015). doi:10.1007\/978-3-319-26626-8_59"},{"key":"10_CR11","doi-asserted-by":"publisher","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)"},{"key":"10_CR12","unstructured":"Lueker, G.S.: Average-case analysis of off-line and on-line knapsack problems. In: SODA, pp. 179\u2013188 (1995)"},{"key":"10_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."},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00186-015-0526-9","volume":"83","author":"C Thielen","year":"2016","unstructured":"Thielen, C., Tiedemann, M., Westphal, S.: The online knapsack problem with incremental capacity. Math. Methods OR 83(2), 207\u2013242 (2016)","journal-title":"Math. Methods OR"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59605-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:26:09Z","timestamp":1710343569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59605-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596044","9783319596051"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59605-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/faw2017.uestc.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}