{"id":"https://openalex.org/W2104935810","doi":"https://doi.org/10.1145/1132516.1132621","title":"Edge-disjoint paths in Planar graphs with constant congestion","display_name":"Edge-disjoint paths in Planar graphs with constant congestion","publication_year":2006,"publication_date":"2006-05-21","ids":{"openalex":"https://openalex.org/W2104935810","doi":"https://doi.org/10.1145/1132516.1132621","mag":"2104935810"},"language":"en","primary_location":{"id":"doi:10.1145/1132516.1132621","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Lucent Bell Labs, Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"Lucent Bell Labs, Murray Hill, NJ","institution_ids":[]}]},{"author_position":"middle","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"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044801840","display_name":"F. Bruce Shepherd","orcid":"https://orcid.org/0000-0003-1972-1396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Bruce Shepherd","raw_affiliation_strings":["Lucent Bell Labs, Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"Lucent Bell Labs, Murray Hill, NJ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2514,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.9449993,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"757","last_page":"766"},"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/T10374","display_name":"Advanced Graph Theory Research","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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/disjoint-sets","display_name":"Disjoint sets","score":0.6764005422592163},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6476855278015137},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5714627504348755},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5502724647521973},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5465030074119568},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5118605494499207},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4865531027317047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4833630919456482},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4422946572303772},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43988457322120667},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.42167532444000244},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4186899662017822},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35107988119125366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3009869158267975},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.21400484442710876},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21166369318962097},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11873447895050049},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0732291042804718}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6764005422592163},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6476855278015137},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5714627504348755},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5502724647521973},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5465030074119568},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5118605494499207},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4865531027317047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4833630919456482},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4422946572303772},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43988457322120667},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.42167532444000244},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4186899662017822},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35107988119125366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3009869158267975},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.21400484442710876},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21166369318962097},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11873447895050049},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0732291042804718},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1132516.1132621","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1563039933","https://openalex.org/W1589172288","https://openalex.org/W1591562949","https://openalex.org/W1964119857","https://openalex.org/W1975442866","https://openalex.org/W1989234747","https://openalex.org/W1999867351","https://openalex.org/W2003160050","https://openalex.org/W2004322147","https://openalex.org/W2012969943","https://openalex.org/W2017713020","https://openalex.org/W2019062750","https://openalex.org/W2042899161","https://openalex.org/W2058091369","https://openalex.org/W2081008200","https://openalex.org/W2085348754","https://openalex.org/W2107881198","https://openalex.org/W2119862441","https://openalex.org/W2121839513","https://openalex.org/W2140262267","https://openalex.org/W2141793995","https://openalex.org/W2145818650","https://openalex.org/W2150148016","https://openalex.org/W2154571828","https://openalex.org/W2160167461","https://openalex.org/W2170344325","https://openalex.org/W2171868840","https://openalex.org/W2176446742","https://openalex.org/W2399312309","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W1991979416","https://openalex.org/W2593080689","https://openalex.org/W2254726702","https://openalex.org/W2906860838","https://openalex.org/W2395976569","https://openalex.org/W276709744","https://openalex.org/W1966079129","https://openalex.org/W2117839333","https://openalex.org/W4234897719","https://openalex.org/W2962731748"],"abstract_inverted_index":{"We":[0],"study":[1,181],"the":[2,22,27,98,149,169,177,184],"maximum":[3],"edge-disjoint":[4,37],"paths":[5,70],"problem":[6,172],"in":[7,65],"undirected":[8],"planar":[9,135,206],"graphs:":[10],"given":[11],"a":[12,81,105,156,164,191,199,213],"graph":[13],"G":[14],"and":[15],"node":[16],"pairs":[17,30],"s1t1,":[18],"s2t2,":[19],"...,":[20],"sktk,":[21],"goal":[23],"is":[24,132,163],"to":[25,68,73,134],"maximize":[26],"number":[28],"of":[29,83,107,202],"that":[31,62,131,141,151,186,211],"can":[32,187],"be":[33,188],"connected":[34],"(routed)":[35],"by":[36,50,190],"paths.":[38],"The":[39,137],"natural":[40],"multicommodity":[41],"flow":[42,99,171,178],"relaxation":[43],"has":[44,80],"an":[45,75,90,116,128],"\u03a9(\u221an)":[46],"integrality":[47],"gap.":[48],"Motivated":[49],"this,":[51],"we":[52,88,114,126,142,161,197,208],"consider":[53],"solutions":[54,64],"with":[55,94,119],"small":[56],"constant":[57,165],"congestion":[58,95,120],"c":[59,69],">":[60],"1;":[61],"is,":[63],"which":[66],"up":[67],"are":[71],"allowed":[72],"use":[74],"edge":[76,79],"(alternatively,":[77],"each":[78],"capacity":[82],"c).":[84],"In":[85],"previous":[86],"work":[87],"obtained":[89],"O(log":[91],"n)":[92],"approximation":[93,118,167,185],"2":[96],"via":[97,176],"relaxation.":[100],"This":[101],"was":[102],"based":[103],"on":[104,155,173,183],"method":[106],"decomposing":[108],"into":[109],"well-linked":[110,192],"subproblems.In":[111],"this":[112,124],"paper":[113],"obtain":[115,123],"O(1)":[117],"4.":[121],"To":[122],"improvement":[125],"develop":[127,162],"alternative":[129],"decomposition":[130,138],"specific":[133],"graphs.":[136],"produces":[139],"instances":[140,175,210],"call":[143],"Okamura-Seymour":[144],"(OS)":[145],"instances.":[146],"These":[147],"have":[148],"property":[150],"all":[152],"terminals":[153],"lie":[154],"single":[157],"face.":[158],"Another":[159],"ingredient":[160],"factor":[166],"for":[168],"all-or-nothing":[170],"OS":[174],"relaxation.We":[179],"also":[180],"limitations":[182],"achieved":[189],"decomposition.":[193],"For":[194,205],"general":[195],"graphs":[196,207],"show":[198],"lower":[200,215],"bound":[201],"\u03a9(log":[203],"n).":[204],"describe":[209],"suggest":[212],"super-constant":[214],"bound.":[216]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}