{"id":"https://openalex.org/W2080283527","doi":"https://doi.org/10.1145/1290672.1290683","title":"Edge-disjoint paths revisited","display_name":"Edge-disjoint paths revisited","publication_year":2007,"publication_date":"2007-11-01","ids":{"openalex":"https://openalex.org/W2080283527","doi":"https://doi.org/10.1145/1290672.1290683","mag":"2080283527"},"language":"en","primary_location":{"id":"doi:10.1145/1290672.1290683","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1290672.1290683","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","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/I2801919071","display_name":"University of Illinois System","ror":"https://ror.org/05e94g991","country_code":"US","type":"education","lineage":["https://openalex.org/I2801919071"]},{"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, Urbana, IL","[University of Illinois, Urbana, IL]"],"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana, IL","institution_ids":["https://openalex.org/I2801919071"]},{"raw_affiliation_string":"[University of Illinois, Urbana, IL]","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":["https://openalex.org/I157725225","https://openalex.org/I2801919071"],"apc_list":null,"apc_paid":null,"fwci":3.6431,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.92939252,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"3","issue":"4","first_page":"46","last_page":"46"},"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.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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/sublinear-function","display_name":"Sublinear function","score":0.7902446985244751},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.753677248954773},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7501988410949707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7406115531921387},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.700710654258728},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6518021821975708},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5833718776702881},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5340988039970398},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5031799674034119},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48840874433517456},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.44879403710365295},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4145446717739105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21688657999038696},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.19908496737480164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08283653855323792}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7902446985244751},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.753677248954773},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7501988410949707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7406115531921387},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.700710654258728},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6518021821975708},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5833718776702881},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5340988039970398},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5031799674034119},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48840874433517456},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.44879403710365295},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4145446717739105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21688657999038696},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.19908496737480164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08283653855323792},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1290672.1290683","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1290672.1290683","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","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":32,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W1479863711","https://openalex.org/W1511849932","https://openalex.org/W1559202792","https://openalex.org/W1563039933","https://openalex.org/W1591562949","https://openalex.org/W1921591048","https://openalex.org/W1963547452","https://openalex.org/W1966838648","https://openalex.org/W1974115975","https://openalex.org/W1996073274","https://openalex.org/W2001532889","https://openalex.org/W2005509629","https://openalex.org/W2008292658","https://openalex.org/W2011039300","https://openalex.org/W2011764853","https://openalex.org/W2019062750","https://openalex.org/W2022191808","https://openalex.org/W2034269606","https://openalex.org/W2125690626","https://openalex.org/W2133017912","https://openalex.org/W2135424293","https://openalex.org/W2140262267","https://openalex.org/W2165956524","https://openalex.org/W2295428206","https://openalex.org/W2569646339","https://openalex.org/W3011766368","https://openalex.org/W4231916799","https://openalex.org/W4301808069","https://openalex.org/W4386213148","https://openalex.org/W6628682275","https://openalex.org/W6996888795"],"related_works":["https://openalex.org/W1600160158","https://openalex.org/W1992520347","https://openalex.org/W2621909025","https://openalex.org/W1798514331","https://openalex.org/W1623845008","https://openalex.org/W3016091878","https://openalex.org/W80300032","https://openalex.org/W128000029","https://openalex.org/W2080283527","https://openalex.org/W2058821164"],"abstract_inverted_index":{"The":[0,241],"approximability":[1],"of":[2,23,53,67,80,87,113,136,189,204],"the":[3,51,56,61,85,98,129,133,137,159,182,234,251],"maximum":[4],"edge-disjoint":[5],"paths":[6],"problem":[7,255],"(EDP)":[8],"in":[9,55,128,158,169,198,213],"directed":[10,170,214],"graphs":[11,173,200,218],"was":[12],"seemingly":[13],"settled":[14],"by":[15,155],"an":[16,29,90,141,186,221],"\u03a9(":[17,62,91],"m":[18,32,49,63,103,150,196,211],"1/2":[19,64,93],"-":[20,65,94],"\u03f5)-hardness":[21,66,95],"result":[22],"Guruswami":[24],"et":[25],"al.":[26],"[2003],":[27],"and":[28,73,147,161,171,174,201,249],"O":[30,101,148,190,205,222],"(\u221a":[31,102,149,223],")":[33,115,144,151,227],"approximation":[34,68,116,177,187,228,237],"achievable":[35],"via":[36,229],"a":[37,45,78,109,124,202],"natural":[38],"multicommodity-flow-based":[39],"LP":[40,139,230],"relaxation":[41],"as":[42,44,77],"well":[43],"greedy":[46,183],"algorithm.":[47],"Here":[48],"is":[50],"number":[52,86],"edges":[54],"graph.":[57],"We":[58,121,179],"observe":[59],"that":[60,83,123,181],"applies":[69],"to":[70,245,250],"sparse":[71],"graphs,":[72],"hence":[74],"when":[75],"expressed":[76],"function":[79],"n":[81,92,114,143,192,207,224,226],",":[82,194,209],"is,":[84],"vertices,":[88],"only":[89],"follows.":[96],"On":[97],"other":[99],"hand,":[100],")-approximation":[104],"algorithms":[105,166],"do":[106],"not":[107],"guarantee":[108],"sublinear":[110,236],"(in":[111],"terms":[112],"algorithm":[117,184],"for":[118,167,239],"dense":[119],"graphs.":[120,215],"note":[122],"similar":[125],"gap":[126,135],"exists":[127],"known":[130],"results":[131,242],"on":[132],"integrality":[134],"flow-based":[138],"relaxation:":[140],"\u03a9(\u221a":[142],"lower":[145,162],"bound":[146],"upper":[152,160],"bound.":[153],"Motivated":[154],"this":[156],"discrepancy":[157],"bounds,":[163],"we":[164,219],"study":[165],"EDP":[168,246],"undirected":[172,199],"obtain":[175],"improved":[176],"ratios.":[178],"show":[180],"has":[185],"ratio":[188,203],"(min(":[191,206],"2/3":[193],"\u221a":[195,210],"))":[197,212],"4/5":[208],"For":[216],"acyclic":[217],"give":[220],"ln":[225],"rounding.":[231],"These":[232],"are":[233],"first":[235],"ratios":[238],"EDP.":[240],"also":[243],"extend":[244],"with":[247],"weights":[248],"uniform-capacity":[252],"unsplittable":[253],"flow":[254],"(UCUFP).":[256]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}