{"id":"https://openalex.org/W2782292024","doi":"https://doi.org/10.1137/15m1043790","title":"Approximation Algorithms for Stochastic and Risk-Averse Optimization","display_name":"Approximation Algorithms for Stochastic and Risk-Averse Optimization","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2782292024","doi":"https://doi.org/10.1137/15m1043790","mag":"2782292024"},"language":"en","primary_location":{"id":"doi:10.1137/15m1043790","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1043790","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5023591555","display_name":"Jaros\u0142aw Byrka","orcid":"https://orcid.org/0000-0002-3387-0913"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jaroslaw Byrka","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3818,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.64833519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"32","issue":"1","first_page":"44","last_page":"63"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9900000095367432,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7928162813186646},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7848911881446838},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.667859673500061},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6556571125984192},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.6189104318618774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.515305757522583},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.49646884202957153},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4959331452846527},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4584062397480011},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44651687145233154},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4354203939437866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3495839238166809},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30949270725250244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2385297417640686},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.12553459405899048},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10819998383522034}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7928162813186646},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7848911881446838},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.667859673500061},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6556571125984192},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.6189104318618774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.515305757522583},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.49646884202957153},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4959331452846527},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4584062397480011},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44651687145233154},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4354203939437866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3495839238166809},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30949270725250244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2385297417640686},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.12553459405899048},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10819998383522034},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m1043790","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1043790","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G106256454","display_name":null,"funder_award_id":"FP6-021235-2","funder_id":"https://openalex.org/F4320338336","funder_display_name":"H2020 Future and Emerging Technologies"},{"id":"https://openalex.org/G1749484715","display_name":"AF: Small: Randomized Algorithms and Stochastic Models","funder_award_id":"1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3080646147","display_name":null,"funder_award_id":"Homing Plus/2010-1/3","funder_id":"https://openalex.org/F4320321042","funder_display_name":"Fundacja na rzecz Nauki Polskiej"},{"id":"https://openalex.org/G3827657932","display_name":"Probabilistic Approaches in Combinatorial Optimization","funder_award_id":"0208005","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G477234496","display_name":null,"funder_award_id":"N N206 368839","funder_id":"https://openalex.org/F4320322733","funder_display_name":"Ministerstwo Edukacji i Nauki"},{"id":"https://openalex.org/G7212731324","display_name":"Collaborative Research:  NeTS-NBD:  An Integrated Approach to Computing Capacity and Developing Efficient Cross-Layer Protocols for Wireless Networks","funder_award_id":"0626636","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7232049732","display_name":null,"funder_award_id":"2015/18/E/ST6/00456","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G776067557","display_name":"ITR - (ASE+NHS) - (DMC+INT+SOC):    Resilient Storage and Querying in Decentralized Networks","funder_award_id":"0426683","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8911331200","display_name":"NetSE: Large: Collaborative Research: Contagion in Large Socio-Communication Networks","funder_award_id":"1010789","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307786","display_name":"Adobe Systems","ror":"https://ror.org/059tvcg64"},{"id":"https://openalex.org/F4320314264","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59"},{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320322733","display_name":"Ministerstwo Edukacji i Nauki","ror":"https://ror.org/05dwvd537"},{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"},{"id":"https://openalex.org/F4320338336","display_name":"H2020 Future and Emerging Technologies","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W113414296","https://openalex.org/W168538608","https://openalex.org/W1484951415","https://openalex.org/W1490324987","https://openalex.org/W1569990960","https://openalex.org/W1752958389","https://openalex.org/W1965765215","https://openalex.org/W1973529814","https://openalex.org/W1974114807","https://openalex.org/W1978117135","https://openalex.org/W1982280823","https://openalex.org/W1983916623","https://openalex.org/W1993119087","https://openalex.org/W2000257769","https://openalex.org/W2006514056","https://openalex.org/W2008298964","https://openalex.org/W2019875157","https://openalex.org/W2022191808","https://openalex.org/W2041025394","https://openalex.org/W2043459466","https://openalex.org/W2052494364","https://openalex.org/W2057974767","https://openalex.org/W2097359823","https://openalex.org/W2109333427","https://openalex.org/W2112058494","https://openalex.org/W2116509768","https://openalex.org/W2121638441","https://openalex.org/W2130956934","https://openalex.org/W2134396776","https://openalex.org/W2143863355","https://openalex.org/W2502170570","https://openalex.org/W2769481137","https://openalex.org/W4243637616","https://openalex.org/W4251495539"],"related_works":["https://openalex.org/W2112112676","https://openalex.org/W2108073487","https://openalex.org/W4247100793","https://openalex.org/W2044818254","https://openalex.org/W1966805076","https://openalex.org/W2326642484","https://openalex.org/W2019875157","https://openalex.org/W2951888513","https://openalex.org/W4301954754","https://openalex.org/W2782292024"],"abstract_inverted_index":{"We":[0,8,57,80],"present":[1,59],"improved":[2],"approximation":[3,30,60,78],"algorithms":[4,31,61],"in":[5,70,85],"stochastic":[6,13],"optimization.":[7],"prove":[9],"that":[10,49],"the":[11,28,53,71,86,103],"multistage":[12],"versions":[14],"of":[15,41,55,67],"covering":[16],"integer":[17],"programs":[18],"(such":[19],"as":[20,32],"set":[21],"cover":[22],"and":[23,43,65,90],"vertex":[24],"cover)":[25],"admit":[26],"essentially":[27],"same":[29],"their":[33],"standard":[34,87],"(nonstochastic)":[35],"counterparts;":[36],"this":[37],"improves":[38],"upon":[39],"work":[40],"Swamy":[42],"Shmoys":[44],"which":[45,99],"shows":[46],"an":[47,91,94],"approximability":[48],"depends":[50],"multiplicatively":[51],"on":[52,76],"number":[54],"stages.":[56],"also":[58],"for":[62],"facility":[63],"location":[64],"some":[66],"its":[68],"variants":[69],"2-stage":[72],"recourse":[73],"model,":[74],"improving":[75],"previous":[77],"guarantees.":[79],"give":[81],"a":[82],"2.2975-approximation":[83],"algorithm":[84,92],"polynomial-scenario":[88],"model":[89],"with":[93],"expected":[95],"per-scenario":[96],"2.4957-approximation":[97],"guarantee,":[98],"is":[100],"applicable":[101],"to":[102],"more":[104],"general":[105],"black-box":[106],"distribution":[107],"model.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}