{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:45:43Z","timestamp":1765485943188,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_1","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Improved Approximation Algorithms for Stochastic Matching"],"prefix":"10.1007","author":[{"given":"Marek","family":"Adamczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Grandoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joydeep","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/j.ipl.2011.05.007","volume":"111","author":"M. Adamczyk","year":"2011","unstructured":"Adamczyk, M.: Improved analysis of the greedy algorithm for stochastic matching. Information Processing Letters\u00a0111, 731\u2013737 (2011)","journal-title":"Information Processing Letters"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Adamczyk, M., Grandoni, F., Mukherjee, J.: Improved approximation algorithms for stochastic matching. CoRR, abs\/1505.01439 (2015)","DOI":"10.1007\/978-3-662-48350-3_1"},{"key":"1_CR3","unstructured":"Adamczyk, M., Sviridenko, M., Ward, J.: Submodular stochastic probing on matroids. In: STACS 2014, pp. 29\u201340 (2014)"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s00453-011-9511-8","volume":"63","author":"N. Bansal","year":"2012","unstructured":"Bansal, N., Gupta, A., Li, J., Mestre, J., Nagarajan, V., Rudra, A.: When LP is the cure for your matching woes: Improved bounds for stochastic matchings. Algorithmica\u00a063(4), 733\u2013762 (2012)","journal-title":"Algorithmica"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-02927-1_23","volume-title":"Automata, Languages and Programming","author":"N. Chen","year":"2009","unstructured":"Chen, N., Immorlica, N., Karlin, A.R., Mahdian, M., Rudra, A.: Approximating matches made in heaven. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 266\u2013278. Springer, Heidelberg (2009)"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"B.C. 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.\u00a033(4), 945\u2013964 (2008)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R. Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. Journal of the ACM\u00a053(3), 324\u2013360 (2006)","journal-title":"Journal of the ACM"},{"key":"1_CR8","unstructured":"Li, J.: Decision making under uncertainty. PhD thesis, University of Maryland (2011)"},{"key":"1_CR9","unstructured":"Li, J.: Private communication (2015)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Ma, W.: Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: Extended abstract. In: SODA 2014, pp. 1154\u20131163 (2014)","DOI":"10.1137\/1.9781611973402.85"},{"key":"1_CR11","unstructured":"Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer (2003)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Distributions on level-sets with applications to approximation algorithms. In: FOCS 2001, pp. 588\u2013597 (2001)","DOI":"10.1109\/SFCS.2001.959935"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T04:43:05Z","timestamp":1653108185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"12 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}