{"id":"https://openalex.org/W7138901808","doi":"https://doi.org/10.1002/net.70035","title":"A Lasso\u2010Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks","display_name":"A Lasso\u2010Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks","publication_year":2026,"publication_date":"2026-03-17","ids":{"openalex":"https://openalex.org/W7138901808","doi":"https://doi.org/10.1002/net.70035"},"language":"en","primary_location":{"id":"doi:10.1002/net.70035","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.70035","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-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/A5130024436","display_name":"Anqi Dong","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Anqi Dong","raw_affiliation_strings":["Division of Decision and Control Systems and Department of Mathematics KTH Royal Institute of Technology  Stockholm Sweden"],"raw_orcid":"https://orcid.org/0000-0002-0365-0733","affiliations":[{"raw_affiliation_string":"Division of Decision and Control Systems and Department of Mathematics KTH Royal Institute of Technology  Stockholm Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035589000","display_name":"Amirhossein Taghvaei","orcid":"https://orcid.org/0000-0002-1536-892X"},"institutions":[{"id":"https://openalex.org/I46020346","display_name":"American Institute of Aeronautics and Astronautics","ror":"https://ror.org/00a1rzv11","country_code":"US","type":"other","lineage":["https://openalex.org/I46020346"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amirhossein Taghvaei","raw_affiliation_strings":["Department of Aeronautics and Astronautics University of Washington  Seattle WA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aeronautics and Astronautics University of Washington  Seattle WA USA","institution_ids":["https://openalex.org/I46020346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035194316","display_name":"Tryphon T. Georgiou","orcid":"https://orcid.org/0000-0003-0012-5447"},"institutions":[{"id":"https://openalex.org/I4210140791","display_name":"Irvine University","ror":"https://ror.org/04ysmca02","country_code":"US","type":"education","lineage":["https://openalex.org/I4210140791"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tryphon T. Georgiou","raw_affiliation_strings":["Department of Mechanical and Aerospace Engineering University of California  Irvine CA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Aerospace Engineering University of California  Irvine CA USA","institution_ids":["https://openalex.org/I4210140791"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035194316"],"corresponding_institution_ids":["https://openalex.org/I4210140791"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3915,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"1","first_page":"28","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.3003000020980835,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.3003000020980835,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.1152999997138977,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.05620000138878822,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.656000018119812},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.49779999256134033},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4893999993801117},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.4648999869823456},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4433000087738037},{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.4417000114917755},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.43790000677108765},{"id":"https://openalex.org/keywords/lasso","display_name":"Lasso (programming language)","score":0.3889000117778778}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.656000018119812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6510999798774719},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.49779999256134033},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4893999993801117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4763000011444092},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.4648999869823456},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4433000087738037},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.4417000114917755},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.43790000677108765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4147000014781952},{"id":"https://openalex.org/C37616216","wikidata":"https://www.wikidata.org/wiki/Q3218363","display_name":"Lasso (programming language)","level":2,"score":0.3889000117778778},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.32910001277923584},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.31679999828338623},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30480000376701355},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C2776085556","wikidata":"https://www.wikidata.org/wiki/Q183361","display_name":"Chen","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2590999901294708}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.70035","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.70035","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320335353","display_name":"National Science Foundation of Sri Lanka","ror":"https://ror.org/010xaa060"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W2039464620","https://openalex.org/W2044980003","https://openalex.org/W2083277843","https://openalex.org/W2084224084","https://openalex.org/W2090747326","https://openalex.org/W2104317982","https://openalex.org/W2105808107","https://openalex.org/W2135046866","https://openalex.org/W2152204644","https://openalex.org/W2160365857","https://openalex.org/W2169528473","https://openalex.org/W2172107427","https://openalex.org/W2294347342","https://openalex.org/W2316564661","https://openalex.org/W2892999051","https://openalex.org/W3118968546","https://openalex.org/W4243449554","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W4387220521"],"related_works":[],"abstract_inverted_index":{"ABSTRACT":[0],"We":[1,30],"revisit":[2],"the":[3,7,42,53,62,65,73],"problem":[4,74],"of":[5,14,37,58,64,68],"finding":[6],"shortest":[8],"path":[9],"between":[10,33],"two":[11],"selected":[12],"vertices":[13],"a":[15,34,47,80],"graph":[16],"and":[17,26,46,79],"formulate":[18],"this":[19,38],"as":[20,52],"an":[21],"\u2010regularized":[22],"regression\u2014Least":[23],"Absolute":[24],"Shrinkage":[25],"Selection":[27],"Operator":[28],"(lasso).":[29],"draw":[31],"connections":[32],"numerical":[35],"implementation":[36],"lasso":[39],"formulation,":[40],"using":[41],"so\u2010called":[43],"LARS":[44],"algorithm,":[45],"more":[48],"established":[49],"algorithm":[50],"known":[51],"bi\u2010directional":[54],"Dijkstra.":[55],"Appealing":[56],"features":[57],"our":[59],"formulation":[60],"include":[61],"applicability":[63],"Alternating":[66],"Direction":[67],"Multiplier":[69],"Method":[70],"(ADMM)":[71],"to":[72,75,84],"identify":[76],"short":[77],"paths,":[78],"relatively":[81],"efficient":[82],"update":[83],"topological":[85],"changes.":[86]},"counts_by_year":[],"updated_date":"2026-06-04T06:14:18.571774","created_date":"2026-03-20T00:00:00"}