{"id":"https://openalex.org/W2044622025","doi":"https://doi.org/10.1137/09076725x","title":"Online and Stochastic Survivable Network Design","display_name":"Online and Stochastic Survivable Network Design","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2044622025","doi":"https://doi.org/10.1137/09076725x","mag":"2044622025"},"language":"en","primary_location":{"id":"doi:10.1137/09076725x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/09076725x","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":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Computer Science Dept. Carnegie Mellon University Pittsburgh PA 15213","Tepper School of Business Carnegie Mellon University Pittsburgh PA 15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Dept. Carnegie Mellon University Pittsburgh PA 15213","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Tepper School of Business Carnegie Mellon University Pittsburgh PA 15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060555975","display_name":"Ravishankar Krishnaswamy","orcid":"https://orcid.org/0000-0002-5765-0843"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravishankar Krishnaswamy","raw_affiliation_strings":["Computer Science Dept. Carnegie Mellon University Pittsburgh PA 15213","Tepper School of Business Carnegie Mellon University Pittsburgh PA 15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Dept. Carnegie Mellon University Pittsburgh PA 15213","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Tepper School of Business Carnegie Mellon University Pittsburgh PA 15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":["Tepper School of Business Carnegie Mellon University Pittsburgh PA 15213","Computer Science Dept. Carnegie Mellon University Pittsburgh PA 15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tepper School of Business Carnegie Mellon University Pittsburgh PA 15213","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Computer Science Dept. Carnegie Mellon University Pittsburgh PA 15213","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.5982,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.85640975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"41","issue":"6","first_page":"1649","last_page":"1672"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/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/T10237","display_name":"Cryptography and Data Security","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.6307439804077148},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6248161196708679},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.599284291267395},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5794292092323303},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5595335364341736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5397750735282898},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5397018790245056},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.509016752243042},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47239920496940613},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4276081919670105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3871770203113556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31043505668640137},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2009076178073883}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6307439804077148},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6248161196708679},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.599284291267395},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5794292092323303},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5595335364341736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5397750735282898},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5397018790245056},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.509016752243042},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47239920496940613},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4276081919670105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3871770203113556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31043505668640137},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2009076178073883},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/09076725x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/09076725x","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.149.9613","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.9613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~anupamg/papers/stoc09-kconn.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.217.6287","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.6287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/%7Eravishan/files/papers/cost-shares.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4702511812","display_name":"CAREER:    Algorithmic Theory and Applications of Metric Emeddings","funder_award_id":"0448095","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4828986989","display_name":"Approximation Algorithms for Network Optimization","funder_award_id":"0728841","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7854016737","display_name":"Collaborative Research: Emerging Directions in Network Design and Optimization","funder_award_id":"0729022","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1968690018","https://openalex.org/W1981114903","https://openalex.org/W1986011879","https://openalex.org/W2001139415","https://openalex.org/W2011823863","https://openalex.org/W2029437526","https://openalex.org/W2052687843","https://openalex.org/W2057974767","https://openalex.org/W2078501279","https://openalex.org/W2089867501","https://openalex.org/W2096881311","https://openalex.org/W2172955861","https://openalex.org/W2178484001","https://openalex.org/W2610631890","https://openalex.org/W3030774092"],"related_works":["https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W2058681277","https://openalex.org/W2781235162","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2772037640","https://openalex.org/W2951573806","https://openalex.org/W2088826026","https://openalex.org/W96431103"],"abstract_inverted_index":{"Consider":[0],"the":[1,39,53,64,98,140,152,164,169,174,186,189,195,200,219,223,230],"edge-connectivity":[2,17,81],"survivable":[3],"network":[4,36,82,176],"design":[5,83,177],"problem":[6,44,62,84,142,178],"(SNDP):":[7],"given":[8],"a":[9,72,122],"graph":[10,191],"$G":[11],"=":[12,92],"(V,E)$":[13],"with":[14,151,179],"edge-costs,":[15],"and":[16,167,194,225,232],"requirements":[18],"$r_{ij}":[19],"\\in":[20,30],"\\mathbb{Z}_{\\geq":[21],"0}$":[22],"for":[23,60,79,118,139,162,218,229],"every":[24],"pair":[25],"of":[26,101,124,173,222,235],"vertices":[27],"$i,":[28],"j":[29],"V$,":[31],"find":[32],"an":[33,112,212],"(approximately)":[34],"minimum-cost":[35],"that":[37,85,147],"provides":[38],"required":[40],"connectivity.":[41,120],"While":[42],"this":[43,61,68,80],"is":[45,192,203],"known":[46,59],"to":[47,115,210],"admit":[48,148],"good":[49],"approximation":[50,145,160,227],"algorithms":[51,57,96,117,130,146,161,228],"in":[52,63,87,157,185],"offline":[54],"case,":[55],"no":[56],"were":[58],"online":[65,77,141,216],"setting.":[66],"In":[67],"paper,":[69],"we":[70,183,205],"give":[71,143,211],"randomized":[73],"$\\tilde{O}(r_{\\max}":[74],"\\log^3":[75],"n)$-competitive":[76,214],"algorithm":[78,217],"runs":[86],"time":[88],"$O(m^{r_{\\max}})$,":[89],"where":[90],"$r_{\\max}":[91],"\\max_{ij}":[93],"r_{ij}$.":[94],"Our":[95,137],"use":[97],"standard":[99],"embeddings":[100],"graphs":[102],"into":[103,107],"random":[104,127],"subtrees":[105],"(i.e.,":[106,199],"singly":[108],"connected":[109],"subgraphs)":[110],"as":[111],"intermediate":[113],"step":[114],"get":[116],"higher":[119],"As":[121],"consequence":[123],"using":[125],"these":[126],"embeddings,":[128],"our":[129,208],"are":[131,184,197],"competitive":[132],"only":[133],"against":[134],"oblivious":[135],"adversaries.":[136],"results":[138,209],"us":[144],"strict":[149],"cost-shares":[150],"same":[153],"strictness":[154],"value.":[155],"This,":[156],"turn,":[158],"implies":[159],"(a)":[163],"rent-or-buy":[165,231],"version":[166,172,221],"(b)":[168],"(two-stage)":[170],"stochastic":[171,233],"edge-connected":[175],"independent":[180],"arrivals.":[181],"If":[182],"case":[187],"when":[188],"underlying":[190],"complete":[193],"edge-costs":[196],"metric":[198],"triangle":[201],"inequality":[202],"satisfied),":[204],"improve":[206],"on":[207],"$O(\\log":[213],"deterministic":[215],"rooted":[220],"problem,":[224],"constant-factor":[226],"variants":[234],"SNDP.":[236]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-27T08:26:11.824852","created_date":"2025-10-10T00:00:00"}