{"id":"https://openalex.org/W2013965337","doi":"https://doi.org/10.1137/s0895480102419743","title":"Algorithms for Fault\u2010Tolerant Routing in Circuit\u2010Switched Networks","display_name":"Algorithms for Fault\u2010Tolerant Routing in Circuit\u2010Switched Networks","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2013965337","doi":"https://doi.org/10.1137/s0895480102419743","mag":"2013965337"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480102419743","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480102419743","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/A5022254797","display_name":"Amitabha Bagchi","orcid":"https://orcid.org/0000-0003-0694-0602"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Amitabha Bagchi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113404970","display_name":"Amitabh Chaudhary","orcid":"https://orcid.org/0000-0001-6232-1238"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amitabh Chaudhary","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063355098","display_name":"Christian Scheideler","orcid":"https://orcid.org/0000-0002-5278-528X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christian Scheideler","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080963999","display_name":"Petr Kolman","orcid":"https://orcid.org/0000-0003-2235-0506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petr Kolman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022254797"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.684,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85165889,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"21","issue":"1","first_page":"141","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9979000091552734,"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/T11182","display_name":"Auction Theory and Applications","score":0.9919999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8092647790908813},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7858026027679443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7051687836647034},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5977005362510681},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5432151556015015},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5277486443519592},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5219418406486511},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4632839560508728},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44234830141067505},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43209099769592285},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42219310998916626},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.41876840591430664}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8092647790908813},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7858026027679443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7051687836647034},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5977005362510681},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5432151556015015},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5277486443519592},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5219418406486511},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4632839560508728},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44234830141067505},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43209099769592285},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42219310998916626},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.41876840591430664},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480102419743","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480102419743","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1515075899","https://openalex.org/W1974115975","https://openalex.org/W1994611404","https://openalex.org/W1999679195","https://openalex.org/W2001532889","https://openalex.org/W2034269606","https://openalex.org/W2084427019","https://openalex.org/W2093227716","https://openalex.org/W2129239025","https://openalex.org/W2140262267","https://openalex.org/W4238472918"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W1488585910","https://openalex.org/W4256429076","https://openalex.org/W2094708479","https://openalex.org/W3127082728","https://openalex.org/W2067936666","https://openalex.org/W2356121840","https://openalex.org/W2567853751","https://openalex.org/W2963158951","https://openalex.org/W2070751425"],"abstract_inverted_index":{"In":[0,208],"this":[1,84,169],"paper":[2],"we":[3,95,172,210,240],"consider":[4,241],"the":[5,14,32,41,64,73,90,97,119,124,132,156,212,223,232,235,282],"k":[6,60,182,189,213,297],"edge\u2010disjoint":[7,16,61],"paths":[8,17,52,62,65,184,278],"problem":[9,33,85,216],"(k\u2010EDP),":[10],"a":[11,20,24,37,104,141,147,174,179,186,202,220,242,262,320],"generalization":[12,221],"of":[13,26,40,75,92,103,127,134,150,160,177,181,188,205,222,264,266,301],"well\u2010known":[15],"problem.":[18,228],"Given":[19],"graph":[21,243],"$G=(V,E)$":[22],"and":[23,63,129,234,247,287,307],"set":[25],"terminal":[27],"pairs":[28,42,68],"(or":[29],"requests)":[30],"T,":[31],"is":[34,48,57,81,108,118,123,131,219,237,259,273,294],"to":[35,50,110,164,252,260,275],"find":[36,261],"maximum":[38,120,267],"subset":[39,263],"in":[43,136,313,323],"T":[44],"for":[45,66,83,86,162,270],"which":[46,153,218,271,318],"it":[47,272],"possible":[49,274],"select":[51,276],"such":[53,279],"that":[54,140,196,238,280],"each":[55,288,300],"pair":[56],"connected":[58,295],"by":[59,296],"different":[67],"are":[69,250,285],"mutually":[70],"disjoint.":[71],"To":[72,88,167],"best":[74,157],"our":[76,93,248],"knowledge,":[77],"no":[78],"nontrivial":[79],"result":[80],"known":[82,109,158],"$k>1$.":[87],"measure":[89],"performance":[91],"algorithms":[94],"use":[96],"recently":[98],"introduced":[99],"flow":[100,227,277,302],"number":[101,133],"F":[102],"graph.":[105],"This":[106],"parameter":[107],"fulfill":[111],"$F=O(\\Delta":[112],"\\alpha^{-1}":[113],"\\log":[114],"n)$,":[115],"where":[116],"$\\Delta$":[117],"degree,":[121],"$\\alpha$":[122],"edge":[125,245],"expansion":[126],"G,":[128],"n":[130],"vertices":[135],"G.":[137],"We":[138,193],"show":[139,195],"simple":[142],"greedy":[143],"online":[144,199],"algorithm":[145,200],"achieves":[146],"competitive":[148,170,203],"ratio":[149,204],"$O(k^3":[151],"F)$":[152],"naturally":[154],"extends":[155],"bound":[159],"$O(F)$":[161],"$k=1$":[163],"higher":[165],"k.":[166],"achieve":[168],"ratio,":[171],"introduce":[173],"new":[175],"method":[176],"converting":[178],"system":[180,187],"disjoint":[183,191,214,298],"into":[185],"length\u2010bounded":[190],"paths.":[192],"also":[194],"any":[197],"deterministic":[198],"has":[201],"$\\Omega(k":[206],"F)$.":[207],"addition,":[209],"study":[211],"flows":[215],"(k\u2010DFP),":[217],"previously":[224],"studied":[225],"unsplittable":[226],"The":[229,257,305],"difference":[230],"between":[231],"k\u2010DFP":[233,308],"k\u2010EDP":[236,306],"now":[239],"with":[244,291],"capacities":[246],"requests":[249,265],"allowed":[251],"have":[253,310],"arbitrary":[254],"demands":[255],"$d_i$.":[256],"aim":[258],"total":[268],"demand":[269,292],"all":[281],"capacity":[283],"constraints":[284],"maintained":[286],"selected":[289],"request":[290],"$d_i$":[293],"paths,":[299],"value":[303],"$d_i/k$.":[304],"problems":[309],"important":[311],"applications":[312],"fault\u2010tolerant":[314],"(virtual)":[315],"circuit":[316],"switching,":[317],"plays":[319],"key":[321],"role":[322],"optical":[324],"networks.":[325]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}