{"id":"https://openalex.org/W2024972568","doi":"https://doi.org/10.1137/060674442","title":"Edge-Disjoint Paths in Planar Graphs with Constant Congestion","display_name":"Edge-Disjoint Paths in Planar Graphs with Constant Congestion","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2024972568","doi":"https://doi.org/10.1137/060674442","mag":"2024972568"},"language":"en","primary_location":{"id":"doi:10.1137/060674442","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060674442","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":true,"oa_status":"green","oa_url":"https://repository.upenn.edu/bitstreams/5bdb419d-669d-45b9-8612-e0f9bb2af162/download","any_repository_has_fulltext":true},"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":["chekuri@cs.uiuc.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"chekuri@cs.uiuc.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["sanjeev@cis.upenn.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"sanjeev@cis.upenn.edu#TAB#","institution_ids":[]}]},{"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":["bruce.shepherd@mcgill.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"bruce.shepherd@mcgill.ca#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.707,"has_fulltext":true,"cited_by_count":33,"citation_normalized_percentile":{"value":0.70678396,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"39","issue":"1","first_page":"281","last_page":"301"},"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.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.9973999857902527,"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/disjoint-sets","display_name":"Disjoint sets","score":0.6729641556739807},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6181210875511169},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5993140935897827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5867214798927307},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5846229791641235},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5422379374504089},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4929671287536621},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.49220600724220276},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4597082734107971},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.44660431146621704},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4429125189781189},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3779284954071045},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22343763709068298},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.2169669270515442},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20937636494636536},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10977527499198914}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6729641556739807},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6181210875511169},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5993140935897827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5867214798927307},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5846229791641235},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5422379374504089},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4929671287536621},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.49220600724220276},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4597082734107971},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.44660431146621704},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4429125189781189},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3779284954071045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22343763709068298},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2169669270515442},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20937636494636536},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10977527499198914},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/060674442","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060674442","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:repository.upenn.edu:cis_papers-1488","is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/451","pdf_url":"https://repository.upenn.edu/bitstreams/5bdb419d-669d-45b9-8612-e0f9bb2af162/download","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.226.4750","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.4750","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.6233","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.6233","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~sanjeev/postscript/stoc06_planar_edp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.966.6469","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.966.6469","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://repository.upenn.edu/cgi/viewcontent.cgi?article%3D1488%26context%3Dcis_papers","raw_type":"text"},{"id":"pmh:oai:repository.upenn.edu:20.500.14332/6504","is_oa":false,"landing_page_url":"https://repository.upenn.edu/handle/20.500.14332/6504","pdf_url":null,"source":{"id":"https://openalex.org/S4377196331","display_name":"Scholarly Commons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:repository.upenn.edu:cis_papers-1488","is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/451","pdf_url":"https://repository.upenn.edu/bitstreams/5bdb419d-669d-45b9-8612-e0f9bb2af162/download","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2024972568.pdf","grobid_xml":"https://content.openalex.org/works/W2024972568.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1563039933","https://openalex.org/W1591562949","https://openalex.org/W1963501983","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/W2058091369","https://openalex.org/W2081008200","https://openalex.org/W2085348754","https://openalex.org/W2104935810","https://openalex.org/W2107881198","https://openalex.org/W2119862441","https://openalex.org/W2121839513","https://openalex.org/W2140262267","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/W2401610261","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W2593080689","https://openalex.org/W1991979416","https://openalex.org/W2952143488","https://openalex.org/W2254726702","https://openalex.org/W2906860838","https://openalex.org/W2395976569","https://openalex.org/W2117839333","https://openalex.org/W276709744","https://openalex.org/W1966079129","https://openalex.org/W4234897719"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,23,28,53,106,158,178,186],"maximum":[3],"edge-disjoint":[4,38],"paths":[5,78],"problem":[6,181],"in":[7,57,73],"undirected":[8],"planar":[9,144],"graphs:":[10],"given":[11],"a":[12,89,113,165,173],"graph":[13],"G":[14],"and":[15],"node":[16],"pairs":[17],"(demands)":[18],"$s_1t_1$,":[19],"$s_2t_2$,":[20],"$\\dots$,":[21],"$s_kt_k$,":[22],"goal":[24],"is":[25,52,141,172],"to":[26,76,81,143],"maximize":[27],"number":[29,54],"of":[30,55,91,115],"demands":[31],"that":[32,70,140,150,160],"can":[33],"be":[34],"connected":[35],"(routed)":[36],"by":[37,60],"paths.":[39],"The":[40,146],"natural":[41],"multicommodity":[42],"flow":[43,107,180,187],"relaxation":[44],"has":[45,88],"an":[46,83,98,125,137],"$\\Omega(\\sqrt{n})$":[47],"integrality":[48],"gap,":[49],"where":[50],"n":[51],"nodes":[56],"G.":[58],"Motivated":[59],"this,":[61],"we":[62,96,123,135,151,170],"consider":[63],"solutions":[64,72],"with":[65,102,128],"small":[66],"constant":[67,174],"congestion":[68,103,129],"$c>1$,":[69],"is,":[71],"which":[74],"up":[75],"c":[77],"are":[79],"allowed":[80],"use":[82],"edge":[84,87],"(alternatively,":[85],"each":[86],"capacity":[90],"c).":[92],"In":[93,120],"previous":[94],"work":[95],"obtained":[97],"$O(\\log":[99],"n)$":[100],"approximation":[101,127,176],"2":[104],"via":[105,185],"relaxation.":[108,188],"This":[109],"was":[110],"based":[111],"on":[112,164,182],"method":[114],"decomposing":[116],"into":[117],"well-linked":[118],"subproblems.":[119],"this":[121,133],"paper":[122],"obtain":[124,132],"$O(1)$":[126],"4.":[130],"To":[131],"improvement":[134],"develop":[136,171],"alternative":[138],"decomposition":[139,147],"specific":[142],"graphs.":[145],"produces":[148],"instances":[149,184],"call":[152],"Okamura\u2013Seymour":[153],"(OS)":[154],"instances.":[155],"These":[156],"have":[157],"property":[159],"all":[161],"terminals":[162],"lie":[163],"single":[166],"face.":[167],"Another":[168],"ingredient":[169],"factor":[175],"for":[177],"all-or-nothing":[179],"OS":[183]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}