{"id":"https://openalex.org/W2997134453","doi":"https://doi.org/10.1137/20m1319401","title":"An Approximation Algorithm for Fully Planar Edge-Disjoint Paths","display_name":"An Approximation Algorithm for Fully Planar Edge-Disjoint Paths","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W2997134453","doi":"https://doi.org/10.1137/20m1319401","mag":"2997134453"},"language":"en","primary_location":{"id":"doi:10.1137/20m1319401","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1319401","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2001.01715","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001969602","display_name":"Chien\u2010Chung Huang","orcid":"https://orcid.org/0000-0003-3482-2646"},"institutions":[{"id":"https://openalex.org/I4210103330","display_name":"\u00c9cole Normale Sup\u00e9rieure","ror":"https://ror.org/01dp7jr64","country_code":"BI","type":"education","lineage":["https://openalex.org/I4210103330"]}],"countries":["BI"],"is_corresponding":true,"raw_author_name":"Chien-Chung Huang","raw_affiliation_strings":["\u00c9cole Normale Superieure"],"affiliations":[{"raw_affiliation_string":"\u00c9cole Normale Superieure","institution_ids":["https://openalex.org/I4210103330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048684646","display_name":"Mathieu Mari","orcid":"https://orcid.org/0000-0001-8074-0241"},"institutions":[{"id":"https://openalex.org/I4210103330","display_name":"\u00c9cole Normale Sup\u00e9rieure","ror":"https://ror.org/01dp7jr64","country_code":"BI","type":"education","lineage":["https://openalex.org/I4210103330"]}],"countries":["BI"],"is_corresponding":false,"raw_author_name":"Mathieu Mari","raw_affiliation_strings":["\u00c9cole Normale Superieure"],"affiliations":[{"raw_affiliation_string":"\u00c9cole Normale Superieure","institution_ids":["https://openalex.org/I4210103330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035864448","display_name":"Claire Mathieu","orcid":"https://orcid.org/0000-0002-0517-112X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Claire Mathieu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056422606","display_name":"Kevin Schewior","orcid":"https://orcid.org/0000-0003-2236-0210"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kevin Schewior","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5028076811","display_name":"Jens Vygen","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Vygen","raw_affiliation_strings":["University of Bonn >  >  >  >"],"affiliations":[{"raw_affiliation_string":"University of Bonn >  >  >  >","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5001969602"],"corresponding_institution_ids":["https://openalex.org/I4210103330"],"apc_list":null,"apc_paid":null,"fwci":0.3029,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57920017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"35","issue":"2","first_page":"752","last_page":"769"},"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.9997000098228455,"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.9991000294685364,"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.70149165391922},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6787877082824707},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6553808450698853},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6311070919036865},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.615263044834137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5429766178131104},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4996922016143799},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49207085371017456},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4491066634654999},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4417390823364258},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.440765917301178},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3987361192703247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32334235310554504},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2643229365348816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23427385091781616},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1546589732170105},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.13863521814346313},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.058316171169281006}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.70149165391922},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6787877082824707},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6553808450698853},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6311070919036865},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.615263044834137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5429766178131104},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4996922016143799},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49207085371017456},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4491066634654999},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4417390823364258},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.440765917301178},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3987361192703247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32334235310554504},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2643229365348816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23427385091781616},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1546589732170105},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.13863521814346313},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.058316171169281006},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1137/20m1319401","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1319401","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"},{"id":"pmh:oai:USBKOELN.ub.uni-koeln.de:59041","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400371","display_name":"K\u00f6lner Universit\u00e4ts PublikationsServer (Universit\u00e4t zu K\u00f6ln)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210115942","host_organization_name":"Rhenish Institute for Environmental Research","host_organization_lineage":["https://openalex.org/I4210115942"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"doc-type:article"},{"id":"pmh:oai:arXiv.org:2001.01715","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.01715","pdf_url":"https://arxiv.org/pdf/2001.01715","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2997134453","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2001.01715","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:HAL:hal-03099892v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03099892","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.752-769. ⟨10.1137/20M1319401⟩","raw_type":"Journal articles"},{"id":"pmh:oai:HAL:hal-03457038v1","is_oa":false,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-03457038","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0895-4801","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.2001.01715","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2001.01715","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2001.01715","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.01715","pdf_url":"https://arxiv.org/pdf/2001.01715","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1511840281","display_name":null,"funder_award_id":"ANR-18-CE40-0025-01","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6297724363","display_name":null,"funder_award_id":"ANR-19-CE48-0016","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W30616553","https://openalex.org/W100926944","https://openalex.org/W589047803","https://openalex.org/W594463866","https://openalex.org/W1970824097","https://openalex.org/W1971175938","https://openalex.org/W2002923907","https://openalex.org/W2005079828","https://openalex.org/W2012329067","https://openalex.org/W2013332890","https://openalex.org/W2019062750","https://openalex.org/W2028436310","https://openalex.org/W2030087828","https://openalex.org/W2032222063","https://openalex.org/W2035099047","https://openalex.org/W2035272561","https://openalex.org/W2041884875","https://openalex.org/W2044343300","https://openalex.org/W2062157728","https://openalex.org/W2062948942","https://openalex.org/W2064284095","https://openalex.org/W2065754663","https://openalex.org/W2069159763","https://openalex.org/W2073834089","https://openalex.org/W2093508305","https://openalex.org/W2114145571","https://openalex.org/W2131433460","https://openalex.org/W2140262267","https://openalex.org/W2154571828","https://openalex.org/W2172955861","https://openalex.org/W2295563127","https://openalex.org/W2297903070","https://openalex.org/W2550041253","https://openalex.org/W2569646339","https://openalex.org/W2611804663","https://openalex.org/W2963966355","https://openalex.org/W2988480584","https://openalex.org/W3148934543"],"related_works":["https://openalex.org/W3154368416","https://openalex.org/W2111221897","https://openalex.org/W2035272561","https://openalex.org/W2104935810","https://openalex.org/W2550041253","https://openalex.org/W2905360057","https://openalex.org/W2794618278","https://openalex.org/W2147969479","https://openalex.org/W2079300367","https://openalex.org/W2102694510","https://openalex.org/W2091981736","https://openalex.org/W2762935521","https://openalex.org/W1485876617","https://openalex.org/W1999021745","https://openalex.org/W1709205181","https://openalex.org/W1581300568","https://openalex.org/W1963724232","https://openalex.org/W2110635609","https://openalex.org/W1965690159","https://openalex.org/W1530482171"],"abstract_inverted_index":{"We":[0,50],"devise":[1],"a":[2,25,38],"constant-factor":[3],"approximation":[4],"algorithm":[5],"for":[6],"the":[7,11,16,21,54],"maximization":[8],"version":[9],"of":[10],"edge-disjoint":[12],"paths":[13],"problem":[14],"if":[15],"supply":[17],"graph":[18,40],"together":[19],"with":[20],"demand":[22,48],"edges":[23],"form":[24],"planar":[26,29,39],"graph.":[27],"By":[28],"duality":[30],"this":[31],"is":[32],"equivalent":[33],"to":[34],"packing":[35],"cuts":[36],"in":[37],"such":[41],"that":[42,53],"each":[43],"cut":[44],"contains":[45],"exactly":[46],"one":[47],"edge.":[49],"also":[51],"show":[52],"natural":[55],"linear":[56],"programming":[57],"relaxations":[58],"have":[59],"constant":[60],"integrality":[61],"gap,":[62],"yielding":[63],"an":[64],"approximate":[65],"max-multiflow":[66],"min-multicut":[67],"theorem.":[68]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}