{"id":"https://openalex.org/W4417424769","doi":"https://doi.org/10.1109/infocom55648.2025.11044521","title":"Parameterized Complexity of Segment Routing","display_name":"Parameterized Complexity of Segment Routing","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W4417424769","doi":"https://doi.org/10.1109/infocom55648.2025.11044521"},"language":"en","primary_location":{"id":"doi:10.1109/infocom55648.2025.11044521","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","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/A5002493273","display_name":"Cristina Bazgan","orcid":"https://orcid.org/0000-0002-5460-6222"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210137929","display_name":"Lamsade","ror":"https://ror.org/03pnp1a74","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2746051580","https://openalex.org/I4210137929","https://openalex.org/I4210159245","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cristina Bazgan","raw_affiliation_strings":["Université Paris-Dauphine, PSL Research University,CNRS, UMR 7243, LAMSADE,Paris,France","LAMSADE - Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision (Place de Lattre de Tassigny 75775 PARIS CEDEX 16 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Université Paris-Dauphine, PSL Research University,CNRS, UMR 7243, LAMSADE,Paris,France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LAMSADE - Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision (Place de Lattre de Tassigny 75775 PARIS CEDEX 16 - France)","institution_ids":["https://openalex.org/I4210137929"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089092295","display_name":"Morgan Chopin","orcid":"https://orcid.org/0000-0002-9668-1300"},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Morgan Chopin","raw_affiliation_strings":["Orange Innovation,Châtillon,France","Orange Innovation (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Orange Innovation,Châtillon,France","institution_ids":["https://openalex.org/I19370010"]},{"raw_affiliation_string":"Orange Innovation (France)","institution_ids":["https://openalex.org/I19370010"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012560459","display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nichterlein","raw_affiliation_strings":["Technische Universität,Algorithmics and Computational Complexity,Berlin,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universität,Algorithmics and Computational Complexity,Berlin,Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115817675","display_name":"Camille Richer","orcid":null},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]},{"id":"https://openalex.org/I4210137929","display_name":"Lamsade","ror":"https://ror.org/03pnp1a74","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2746051580","https://openalex.org/I4210137929","https://openalex.org/I4210159245","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Camille Richer","raw_affiliation_strings":["Orange Innovation,Chätillon,France","LAMSADE - Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision (Place de Lattre de Tassigny 75775 PARIS CEDEX 16 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Orange Innovation,Chätillon,France","institution_ids":["https://openalex.org/I19370010"]},{"raw_affiliation_string":"LAMSADE - Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision (Place de Lattre de Tassigny 75775 PARIS CEDEX 16 - France)","institution_ids":["https://openalex.org/I4210137929"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35307085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.5303999781608582,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.5303999781608582,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.15330000221729279,"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.12999999523162842,"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/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6308000087738037},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.49619999527931213},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4934000074863434},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.47839999198913574},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.45879998803138733},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.45350000262260437},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4390000104904175},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4058000147342682},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.391400009393692}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6308000087738037},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6154000163078308},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.49619999527931213},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4934000074863434},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.47839999198913574},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.45879998803138733},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.45350000262260437},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4390000104904175},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.414000004529953},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4058000147342682},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.391400009393692},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.3831999897956848},{"id":"https://openalex.org/C2781271823","wikidata":"https://www.wikidata.org/wiki/Q138081","display_name":"Waypoint","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3747999966144562},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.361299991607666},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.35600000619888306},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.2946999967098236},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.28929999470710754},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.2881999909877777},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.28600001335144043},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27059999108314514},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2639000117778778}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infocom55648.2025.11044521","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-05417523v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05417523","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":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications, May 2025, London, France. pp.1-10, ⟨10.1109/INFOCOM55648.2025.11044521⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Segment":[0,72],"Routing":[1],"is":[2,71,87,151],"a":[3,25,28,75,78,97,170,178],"recent":[4],"network":[5,10,53,76],"technology":[6],"that":[7,103],"helps":[8],"optimizing":[9],"throughput":[11],"by":[12,57],"providing":[13],"finer":[14],"control":[15],"over":[16],"the":[17,39,52,64,85,94,117,120,160],"routing":[18,22,48,107],"paths.":[19],"Instead":[20],"of":[21,63,80,96,100,119,127,162,173,181],"directly":[23],"from":[24],"source":[26],"to":[27,44,88],"target,":[29],"packets":[30,40],"are":[31,41,113],"routed":[32,42],"via":[33],"intermediate":[34],"waypoints.":[35],"Between":[36],"consecutive":[37],"waypoints,":[38,110],"according":[43],"traditional":[45],"shortest":[46,105],"path":[47,106],"protocols.":[49],"Bottlenecks":[50],"in":[51],"can":[54],"be":[55,132],"avoided":[56],"such":[58,102],"rerouting,":[59],"preventing":[60],"overloading":[61],"parts":[62],"network.":[65,121],"The":[66],"associated":[67],"NP-hard":[68],"computational":[69],"problem":[70],"Routing:":[73],"Given":[74],"and":[77,177],"set":[79],"traffic":[81,182],"demands":[82,112],"(vertex":[83],"pairs),":[84],"task":[86],"find":[89],"for":[90],"each":[91],"demand":[92,150,176],"pair":[93],"placement":[95],"given":[98],"number":[99,172],"waypoints":[101,174],"with":[104,141,189],"along":[108],"these":[109,186],"all":[111],"fulfilled":[114],"without":[115],"exceeding":[116],"capacities":[118],"We":[122,153,184],"investigate":[123],"if":[124,145,167],"special":[125,192],"structures":[126],"real-world":[128],"communication":[129],"networks":[130],"could":[131],"exploited":[133],"algorithmically.":[134],"Our":[135],"results":[136],"comprise":[137],"NP-hardness":[138],"on":[139],"graphs":[140],"constant":[142],"treewidth":[143],"even":[144,166],"only":[146],"one":[147],"waypoint":[148],"per":[149,175],"allowed.":[152],"further":[154],"exclude":[155],"(under":[156],"standard":[157],"complexity":[158],"assumptions)":[159],"existence":[161],"efficient":[163],"exact":[164],"algorithms":[165],"we":[168],"assume":[169],"fixed":[171],"\u201csmall\u201d":[179],"amount":[180],"demands.":[183],"complement":[185],"lower":[187],"bounds":[188],"polynomial-time":[190],"solvable":[191],"cases.":[193]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}