{"id":"https://openalex.org/W4387914291","doi":"https://doi.org/10.1109/codit58514.2023.10284353","title":"The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms","display_name":"The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms","publication_year":2023,"publication_date":"2023-07-03","ids":{"openalex":"https://openalex.org/W4387914291","doi":"https://doi.org/10.1109/codit58514.2023.10284353"},"language":"en","primary_location":{"id":"doi:10.1109/codit58514.2023.10284353","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/codit58514.2023.10284353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5067831455","display_name":"Roland Grappe","orcid":"https://orcid.org/0000-0002-7093-2175"},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Roland Grappe","raw_affiliation_strings":["Université Sorbonne Paris Nord,LIPN,Paris,France"],"raw_orcid":"https://orcid.org/0000-0002-7093-2175","affiliations":[{"raw_affiliation_string":"Université Sorbonne Paris Nord,LIPN,Paris,France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065784195","display_name":"Mathieu Lacroix","orcid":"https://orcid.org/0000-0001-8385-3890"},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Lacroix","raw_affiliation_strings":["Université Sorbonne Paris Nord,LIPN,Paris,France"],"raw_orcid":"https://orcid.org/0000-0001-8385-3890","affiliations":[{"raw_affiliation_string":"Université Sorbonne Paris Nord,LIPN,Paris,France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083892488","display_name":"S\u00e9bastien Martin","orcid":"https://orcid.org/0000-0002-8528-6698"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S\u00e9bastien Martin","raw_affiliation_strings":["Huaweï Technologies & Co,Boulogne-Billancourt,France"],"raw_orcid":"https://orcid.org/0000-0002-8528-6698","affiliations":[{"raw_affiliation_string":"Huaweï Technologies & Co,Boulogne-Billancourt,France","institution_ids":["https://openalex.org/I4210123571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"956","last_page":"961"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12176","display_name":"Optimization and Packing Problems","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8062852621078491},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.745110273361206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6773106455802917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5705227255821228},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5469640493392944},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5049777626991272},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.48587316274642944},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4236035645008087},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37873348593711853},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29506367444992065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28250017762184143},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1551448106765747}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8062852621078491},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.745110273361206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6773106455802917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5705227255821228},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5469640493392944},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5049777626991272},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.48587316274642944},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4236035645008087},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37873348593711853},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29506367444992065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28250017762184143},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1551448106765747}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit58514.2023.10284353","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/codit58514.2023.10284353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.44999998807907104,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2003160050","https://openalex.org/W2007572995","https://openalex.org/W2007687856","https://openalex.org/W2085478109","https://openalex.org/W2104734478","https://openalex.org/W2114574859","https://openalex.org/W2140763777","https://openalex.org/W2144946856","https://openalex.org/W2169528473","https://openalex.org/W2295324809","https://openalex.org/W2401610261","https://openalex.org/W2953980454","https://openalex.org/W6697476482"],"related_works":["https://openalex.org/W4223969905","https://openalex.org/W2578319993","https://openalex.org/W2363342665","https://openalex.org/W4310124294","https://openalex.org/W2354846196","https://openalex.org/W2379804627","https://openalex.org/W2990531685","https://openalex.org/W2359532380","https://openalex.org/W2391130892","https://openalex.org/W2886722595"],"abstract_inverted_index":{"In":[0],"this":[1,27,56],"paper,":[2],"we":[3,52,78],"propose":[4,53,97],"two":[5,49],"exact":[6],"algorithms":[7,31,69],"based":[8,33],"on":[9,34,70,86],"the":[10,13,18,40,80,83,87,101],"computation":[11,41],"of":[12,29,42,63,82,89,93,100],"Dijkstra":[14,64],"tree":[15],"to":[16,25,104],"solve":[17,26],"multiple":[19],"pairs":[20],"shortest":[21],"path":[22],"problem.":[23],"Traditionally,":[24],"kind":[28],"problems,":[30],"are":[32],"distance":[35],"matrices.":[36],"For":[37],"sparse":[38],"graphs,":[39],"these":[43],"matrices":[44],"is":[45],"too":[46],"costly.":[47],"The":[48],"approaches":[50],"that":[51],"allow":[54],"tackling":[55],"issue":[57],"by":[58],"computing":[59],"a":[60],"small":[61],"number":[62],"trees.":[65],"We":[66,95],"test":[67],"our":[68],"telecommunication":[71],"network":[72],"instances":[73],"and":[74,77,91],"random":[75],"instances,":[76],"discuss":[79],"dependence":[81],"obtained":[84],"results":[85],"structure":[88],"sources":[90],"destinations":[92,107],"commodities.":[94],"also":[96],"an":[98],"extension":[99],"Bi-Dijkstra":[102],"algorithm":[103],"consider":[105],"several":[106],"together.":[108]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}