{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T21:06:54Z","timestamp":1762808814432,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271947"},{"type":"electronic","value":"9783030271954"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-27195-4_24","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"261-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem"],"prefix":"10.1007","author":[{"given":"Jian","family":"Sun","sequence":"first","affiliation":[]},{"given":"Haiyun","family":"Sheng","sequence":"additional","affiliation":[]},{"given":"Yuefang","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32, 171\u2013176 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2432622.2432628","volume":"60","author":"J Byrka","year":"2013","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 1\u201333 (2013)","journal-title":"J. ACM"},{"key":"24_CR3","first-page":"20","volume":"64","author":"S Chopra","year":"1994","unstructured":"Chopra, S., Rao, M.R.: The Steiner tree problem I: formulations, compositions and extension of facets. Math. Program. 64, 20\u2013229 (1994)","journal-title":"Math. Program."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01582574","volume":"64","author":"S Chopra","year":"1994","unstructured":"Chopra, S., Rao, M.R.: Properties and classes of facets: the Steiner tree problem II. Math. Program. 64, 231\u2013246 (1994)","journal-title":"Math. Program."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Chopra, S., Tsai, C.Y.: Polyhedral approaches for the Steiner tree problem on graphs. In: Steiner Trees in Industry, pp. 175\u2013202. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-1-4613-0255-1_5"},{"key":"24_CR6","unstructured":"Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: A faster implementation of the Goemans-Williamson clustering algorithm. In: Proceedings of the 12th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 17\u201325 (2001)"},{"issue":"5","key":"24_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2007.03.012","volume":"103","author":"P Feofiloff","year":"2007","unstructured":"Feofiloff, P., Fernandes, C.G., Ferreira, C.E., Pina, J.C.D.: Primal-dual approximation algorithms for the prize-collecting Steiner tree problem. Inf. Process. Lett. 103(5), 195\u2013202 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha A.: Boosted sampling: approximation algorithms for stochastic optimization problems. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 417\u2013426 (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1021805924152","volume":"24","author":"H Heitsch","year":"2003","unstructured":"Heitsch, H., R\u00f6misch, W.: Scenario reduction algorithm in stochastic programming. Comput. Optim. Appl. 24, 187\u2013206 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"24_CR11","volume-title":"Approximation Algorithms for NP-hard Problems","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston (1997)"},{"key":"24_CR12","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 760\u2013769 (2000)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-36046-6_14","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"D Kurz","year":"2013","unstructured":"Kurz, D., Mutzel, P., Zey, B.: Parameterized algorithms for stochastic Steiner tree problems. In: Ku\u010dera, A., Henzinger, T.A., Ne\u0161et\u0159il, J., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2012. LNCS, vol. 7721, pp. 143\u2013154. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36046-6_14"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: approximation algorithms for stochastic optimization problems. 108(1), 97\u2013114 (2006)","DOI":"10.1007\/s10107-005-0673-5"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1111\/j.1467-9574.1996.tb01506.x","volume":"50","author":"R Schultz","year":"1996","unstructured":"Schultz, R., Stougie, L., van der Vlerk, M.H.: Two stage stochastic integer programming: a survey. Statistica Neerlandica 50(3), 404\u2013416 (1996)","journal-title":"Statistica Neerlandica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27195-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:17:36Z","timestamp":1709824656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","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":"aaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theory.ict.ac.cn\/aaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}