{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T05:51:54Z","timestamp":1775109114286,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540282396","type":"print"},{"value":"9783540318743","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_22","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:13:22Z","timestamp":1285632802000},"page":"257-269","source":"Crossref","is-referenced-by-count":45,"title":["Sampling Bounds for Stochastic Optimization"],"prefix":"10.1007","author":[{"given":"Moses","family":"Charikar","sequence":"first","affiliation":[]},{"given":"Chandra","family":"Chekuri","sequence":"additional","affiliation":[]},{"given":"Martin","family":"P\u00e1l","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11496915_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Dhamhere","year":"2005","unstructured":"Dhamhere, K., Ravi, R., Singh, M.: On two-stage Stochastic Minimum Spanning Trees. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 321\u2013334. Springer, Heidelberg (2005)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Flaxman, A., Frieze, A., Krivelevich, M.: On the random 2-stage minimum spanning tree. In: Proc. of SODA (2005)","DOI":"10.1002\/rsa.20079"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"a.Gupta, M. P\u00e1l, R. Ravi, and A. Sinha. Boosted sampling: Approximation algorithms for stochastic optimization. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"22_CR4","unstructured":"Gupta, A., Ravi, R., Sinha, A.: An edge in time saves nine: Lp rounding approximation algorithms. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (2004)"},{"key":"22_CR5","unstructured":"Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.: On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"J. Kleywegt","year":"2001","unstructured":"Kleywegt, J., Shapiro, A., Homem-De-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. on Optimization\u00a012, 479\u2013502 (2001)","journal-title":"SIAM J. on Optimization"},{"key":"22_CR7","unstructured":"Mahdian, M.: Facility Location and the Analysis of Algorithms through Factor- Revealing Programs. Ph.D. Thesis, MIT (June 2004)"},{"key":"22_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"22_CR9","series-title":"Handbook in Operations Research and Management Science","volume-title":"Stochastic Programming","year":"2003","unstructured":"Ruszczynski, A., Shapiro, A. (eds.): Stochastic Programming. Handbook in Operations Research and Management Science, vol.\u00a010. Elsevier, Amsterdam (2003)"},{"key":"22_CR10","series-title":"Handbook in Operations Research and Management Science","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(03)10006-0","volume-title":"Stochastic Programming","author":"A. Shapiro","year":"2003","unstructured":"Shapiro, A.: Montecarlo sampling methods. In: Ruszczynski, A., Shapiro, A. (eds.) Stochastic Programming. Handbook in Operations Research and Management Science, vol.\u00a010. Elsevier, Amsterdam (2003)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-25960-2_8","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. Ravi","year":"2004","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 101\u2013115. Springer, Heidelberg (2004)"},{"key":"22_CR12","unstructured":"Ravi, R., Singh, M.: Personal communication (February 2005)"},{"key":"22_CR13","unstructured":"Shmoys, D., Swamy, C.: Stochastic optimization is (almost) as easy as deterministic optimization. In: Proc. of FOCS (2004)"},{"key":"22_CR14","unstructured":"Shmoys, D., Swamy, C.: The Sample Average Approximation Method for 2-stage Stochastic Optimization (November 2004) (manuscript)"},{"key":"22_CR15","unstructured":"Shmoys, D., Swamy, C.: Sampling-based Approximation Algorithms for Multistage Stochastic Optimization (2005) (manuscript)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538462_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:50:25Z","timestamp":1558291825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11538462_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}