{"id":"https://openalex.org/W2008298964","doi":"https://doi.org/10.1137/080732250","title":"Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems","display_name":"Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2008298964","doi":"https://doi.org/10.1137/080732250","mag":"2008298964"},"language":"en","primary_location":{"id":"doi:10.1137/080732250","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080732250","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["anupamg@cs.cmu.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"anupamg@cs.cmu.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064235715","display_name":"Martin P\u00e1l","orcid":"https://orcid.org/0000-0002-1563-5426"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin P\u00e1l","raw_affiliation_strings":["martin@palenica.com#TAB#"],"affiliations":[{"raw_affiliation_string":"martin@palenica.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024448261","display_name":"Amitabh Sinha","orcid":"https://orcid.org/0000-0002-6035-3671"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amitabh Sinha","raw_affiliation_strings":["amitabh@umich.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"amitabh@umich.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5078381067"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6005,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.89130435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"40","issue":"5","first_page":"1361","last_page":"1401"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7793552875518799},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.630500078201294},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5813255906105042},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5754612684249878},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5190768837928772},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4878559112548828},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4782401919364929},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.4757532775402069},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45278874039649963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44879379868507385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42526373267173767},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.41873639822006226},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.08849087357521057}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7793552875518799},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.630500078201294},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5813255906105042},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5754612684249878},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5190768837928772},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4878559112548828},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4782401919364929},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.4757532775402069},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45278874039649963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44879379868507385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42526373267173767},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.41873639822006226},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.08849087357521057},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/080732250","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080732250","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W1484951415","https://openalex.org/W1519520700","https://openalex.org/W1523452202","https://openalex.org/W1528210381","https://openalex.org/W1569990960","https://openalex.org/W1824000689","https://openalex.org/W1825072153","https://openalex.org/W1974114807","https://openalex.org/W1975656821","https://openalex.org/W1980938359","https://openalex.org/W1981673685","https://openalex.org/W1982280823","https://openalex.org/W1983916623","https://openalex.org/W1990327548","https://openalex.org/W1999032440","https://openalex.org/W2001139415","https://openalex.org/W2002285507","https://openalex.org/W2004321562","https://openalex.org/W2011232221","https://openalex.org/W2011823863","https://openalex.org/W2017927472","https://openalex.org/W2019315457","https://openalex.org/W2019875157","https://openalex.org/W2044081853","https://openalex.org/W2057974767","https://openalex.org/W2064147138","https://openalex.org/W2095969632","https://openalex.org/W2096881311","https://openalex.org/W2101622070","https://openalex.org/W2107390991","https://openalex.org/W2109156431","https://openalex.org/W2111072608","https://openalex.org/W2112058494","https://openalex.org/W2114752827","https://openalex.org/W2116509768","https://openalex.org/W2121638441","https://openalex.org/W2136442119","https://openalex.org/W2140844111","https://openalex.org/W2143863355","https://openalex.org/W2154290910","https://openalex.org/W2154920280","https://openalex.org/W2502170570","https://openalex.org/W2611804663","https://openalex.org/W2914209516","https://openalex.org/W3106992008","https://openalex.org/W3123380468","https://openalex.org/W4241627825","https://openalex.org/W4243637616","https://openalex.org/W4251495539"],"related_works":["https://openalex.org/W2019875157","https://openalex.org/W2951888513","https://openalex.org/W4301954754","https://openalex.org/W2913526350","https://openalex.org/W2471430835","https://openalex.org/W2934941469","https://openalex.org/W3155121003","https://openalex.org/W610717788","https://openalex.org/W2008298964","https://openalex.org/W3185873601"],"abstract_inverted_index":{"We":[0,102,155,188],"consider":[1],"two-":[2],"and":[3,31,90,121,145],"multistage":[4],"versions":[5],"of":[6,66,99,128,142,202,218],"stochastic":[7,107,185,200],"combinatorial":[8,20,108],"optimization":[9,21,109,186],"problems":[10,110],"with":[11,69,165],"recourse:":[12],"in":[13,93,178],"this":[14,175,191],"framework,":[15],"the":[16,19,36,52,54,64,88,113,117,122,139,143,152,166,183,199,203,215],"instance":[17],"for":[18,80,106,182,198],"problem":[22,209],"is":[23,32,56,74],"drawn":[24],"from":[25],"a":[26,75,129,147,208],"known":[27],"probability":[28,140],"distribution":[29,141],"$\\pi$":[30],"only":[33],"revealed":[34],"to":[35,58,83,96,150,169,193],"algorithm":[37,55,137,197],"over":[38],"two":[39],"(or":[40],"multiple)":[41],"stages.":[42],"At":[43],"each":[44,70],"stage,":[45,72,135],"on":[46],"receiving":[47],"some":[48,60],"more":[49,85],"information":[50,86],"about":[51,87],"instance,":[53,89],"allowed":[57],"build":[59],"partial":[61,148,172],"solution.":[62],"Since":[63],"costs":[65],"elements":[67,92],"increase":[68],"passing":[71],"there":[73],"natural":[76],"tension":[77],"between":[78],"waiting":[79],"later":[81],"stages,":[82,95],"gain":[84],"purchasing":[91],"earlier":[94],"take":[97],"advantages":[98],"lower":[100],"costs.":[101],"provide":[103,194],"approximation":[104,180,196],"algorithms":[105,167],"(such":[111],"as":[112],"Steiner":[114,118],"tree":[115],"problem,":[116,120,207],"network":[119],"vertex":[123],"cover":[124],"problem)":[125],"by":[126],"means":[127],"simple":[130],"sampling-based":[131],"algorithm.":[132],"In":[133],"every":[134],"our":[136,219],"samples":[138],"requirements":[144],"constructs":[146],"solution":[149],"serve":[151],"resulting":[153],"sample.":[154],"show":[156],"that":[157,210],"if":[158],"one":[159],"can":[160],"construct":[161,170],"cost-sharing":[162],"functions":[163],"associated":[164],"used":[168],"these":[171],"solutions,":[173],"then":[174],"strategy":[176],"results":[177],"provable":[179],"guarantees":[181],"overall":[184],"problem.":[187],"also":[189],"extend":[190],"approach":[192],"an":[195],"version":[201],"uncapacitated":[204],"facility":[205],"location":[206],"does":[211],"not":[212],"fit":[213],"into":[214],"simpler":[216],"framework":[217],"main":[220],"model.":[221]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}