{"id":"https://openalex.org/W2043644965","doi":"https://doi.org/10.1145/1324215.1324236","title":"Routing and network design with robustness to changing or uncertain traffic demands","display_name":"Routing and network design with robustness to changing or uncertain traffic demands","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W2043644965","doi":"https://doi.org/10.1145/1324215.1324236","mag":"2043644965"},"language":"en","primary_location":{"id":"doi:10.1145/1324215.1324236","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1324215.1324236","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["","University of Illinois at Urbana Champaign"],"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":4.4919,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.94437086,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"38","issue":"3","first_page":"106","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7095396518707275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6707500219345093},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6035715937614441},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4840066134929657},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.47884249687194824},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.44522517919540405},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43623125553131104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2801511287689209},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21124818921089172},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11645326018333435}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7095396518707275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6707500219345093},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6035715937614441},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4840066134929657},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.47884249687194824},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.44522517919540405},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43623125553131104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2801511287689209},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21124818921089172},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11645326018333435},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1324215.1324236","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1324215.1324236","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.212.2793","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.2793","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiuc.edu/homes/chekuri/papers/robust_survey.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W148398262","https://openalex.org/W179830015","https://openalex.org/W1501204926","https://openalex.org/W1755312702","https://openalex.org/W1952648253","https://openalex.org/W1963964297","https://openalex.org/W1966816698","https://openalex.org/W1971443646","https://openalex.org/W1973444128","https://openalex.org/W1977545325","https://openalex.org/W1988294273","https://openalex.org/W1994495069","https://openalex.org/W1999867351","https://openalex.org/W2003300440","https://openalex.org/W2013355418","https://openalex.org/W2019819077","https://openalex.org/W2020066367","https://openalex.org/W2020632401","https://openalex.org/W2020682445","https://openalex.org/W2022092881","https://openalex.org/W2030087828","https://openalex.org/W2047204731","https://openalex.org/W2054655788","https://openalex.org/W2059635852","https://openalex.org/W2068811470","https://openalex.org/W2072947773","https://openalex.org/W2076704288","https://openalex.org/W2079003301","https://openalex.org/W2079936083","https://openalex.org/W2094410510","https://openalex.org/W2100440346","https://openalex.org/W2104701012","https://openalex.org/W2105291450","https://openalex.org/W2105787370","https://openalex.org/W2106481801","https://openalex.org/W2107997203","https://openalex.org/W2114493937","https://openalex.org/W2119862441","https://openalex.org/W2120358419","https://openalex.org/W2123138012","https://openalex.org/W2124295613","https://openalex.org/W2125570197","https://openalex.org/W2130307064","https://openalex.org/W2136173851","https://openalex.org/W2136558412","https://openalex.org/W2145818650","https://openalex.org/W2149929647","https://openalex.org/W2150148016","https://openalex.org/W2151534739","https://openalex.org/W2169143327","https://openalex.org/W2170190881","https://openalex.org/W2625029195","https://openalex.org/W2988480584","https://openalex.org/W3030774092","https://openalex.org/W4213272272","https://openalex.org/W4244823362","https://openalex.org/W4247051268","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2770593030","https://openalex.org/W3154990682","https://openalex.org/W4281727072","https://openalex.org/W2560201613","https://openalex.org/W2171975302","https://openalex.org/W2022352247","https://openalex.org/W2377538627","https://openalex.org/W2107220315","https://openalex.org/W1589637664","https://openalex.org/W2142809053"],"abstract_inverted_index":{"A":[0],"new":[1],"class":[2],"of":[3,28,72,87,92,109,116,125],"network":[4],"design":[5],"problems":[6],"were":[7],"introduced":[8],"by":[9,16,57,84],"Fingerhut":[10],"et":[11,18],"al.":[12,19],"[26],":[13],"and":[14,59,119],"independently":[15],"Duffield":[17],"[20],":[20],"to":[21,53],"address,":[22],"among":[23],"other":[24],"things,":[25],"the":[26,31,54,70,88,102,123,133],"issue":[27],"uncertainty":[29],"in":[30,42,77,105],"demand":[32,45],"matrix.":[33],"The":[34],"so-called":[35],"hose":[36],"model":[37,56],"(the":[38],"term":[39],"was":[40,50,82],"coined":[41],"[20])":[43],"for":[44],"matrices":[46],"from":[47],"[26,":[48],"20]":[49],"subsequently":[51],"generalized":[52],"polyhedral":[55],"Ben-Ameur":[58],"Kerivin":[60],"[11,":[61],"10].":[62],"In":[63],"a":[64,85,106,114,127],"different":[65],"direction,":[66],"R\u00e4acke":[67],"[51]":[68],"showed":[69],"existence":[71],"good":[73],"randomized":[74],"oblivious":[75,95],"routings":[76],"all":[78],"undirected":[79],"graphs.":[80],"This":[81],"followed":[83],"proof":[86],"polynomial":[89],"time":[90],"solvability":[91],"an":[93],"optimal":[94],"routing":[96],"scheme":[97],"[7].":[98],"One":[99],"can":[100],"view":[101],"above":[103],"developments":[104,118],"common":[107],"framework":[108],"robust":[110],"optimization.":[111],"We":[112,130],"give":[113],"survey":[115],"these":[117],"related":[120],"work":[121],"with":[122],"aim":[124],"providing":[126],"unified":[128],"picture.":[129],"also":[131],"highlight":[132],"remaining":[134],"open":[135],"problems.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}