{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:35:05Z","timestamp":1743068105521,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_48","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"653-668","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Submodular Maximization with Uncertain Knapsack Capacity"],"prefix":"10.1007","author":[{"given":"Yasushi","family":"Kawase","sequence":"first","affiliation":[]},{"given":"Hanna","family":"Sumita","sequence":"additional","affiliation":[]},{"given":"Takuro","family":"Fukunaga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"issue":"3","key":"48_CR1","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1287\/moor.2015.0766","volume":"41","author":"M Adamczyk","year":"2016","unstructured":"Adamczyk, M., Sviridenko, M., Ward, J.: Submodular stochastic probing on matroids. Math. Oper. Res. 41(3), 1022\u20131038 (2016)","journal-title":"Math. Oper. Res."},{"key":"48_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-540-92185-1_53","volume-title":"Internet and Network Economics","author":"A Asadpour","year":"2008","unstructured":"Asadpour, A., Nazerzadeh, H., Saberi, A.: Stochastic submodular maximization. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 477\u2013489. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_53"},{"issue":"6","key":"48_CR3","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G C\u0103linescu","year":"2011","unstructured":"C\u0103linescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"key":"48_CR4","unstructured":"Dabney, M.: A PTAS for the uncertain capacity knapsack problem. Master\u2019s thesis, Clemson University (2010)"},{"issue":"4","key":"48_CR5","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"BC Dean","year":"2008","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. Math. Oper. Res. 33(4), 945\u2013964 (2008)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"48_CR6","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1137\/16M1070049","volume":"31","author":"Y Disser","year":"2017","unstructured":"Disser, Y., Klimm, M., Megow, N., Stiller, S.: Packing a knapsack of unknown capacity. SIAM J. Discrete Math. 31(3), 1477\u20131497 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"48_CR7","unstructured":"Feldman, M.: Maximization problems with submodular objective functions. Ph.D. thesis, Technion - Israel Institute of Technology, July 2013"},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: FOCS, pp. 570\u2013579 (2011)","DOI":"10.1109\/FOCS.2011.46"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.L.: Online contention resolution schemes. In: SODA, pp. 1014\u20131033 (2016)","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"48_CR10","first-page":"427","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42, 427\u2013486 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krishnaswamy, R., Molinaro, M., Ravi, R.: Approximation algorithms for correlated knapsacks and non-martingale bandits. In: FOCS, 827\u2013836 (2011)","DOI":"10.1109\/FOCS.2011.48"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, A., Nagarajan, V., Singla, S.: Adaptivity gaps for stochastic probing: submodular and XOS functions. In: SODA, pp. 1688\u20131702 (2017)","DOI":"10.1137\/1.9781611974782.111"},{"issue":"4","key":"48_CR13","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/2629652","volume":"11","author":"W H\u00f6hn","year":"2015","unstructured":"H\u00f6hn, W., Jacobs, T.: On the performance of Smith\u2019s rule in single-machine scheduling with nonlinear cost. ACM Trans. Algorithms 11(4), 25:1\u201325:30 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Ma, W.: Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract. In: SODA, pp. 1154\u20131163 (2014)","DOI":"10.1137\/1.9781611973402.85"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Megow, N., Mestre, J.: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. In: ITCS, pp. 495\u2013504 (2013)","DOI":"10.1145\/2422436.2422490"},{"key":"48_CR17","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-642-39206-1_63","volume-title":"ICALP 2013","author":"N Megow","year":"2013","unstructured":"Megow, N., Verschae, J.: Dual techniques for scheduling on a machine with varying speed. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 745\u2013756. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_63"},{"issue":"1","key":"48_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:04:40Z","timestamp":1709827480000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}