{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:12:00Z","timestamp":1780384320499,"version":"3.54.1"},"reference-count":26,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Networks"],"published-print":{"date-parts":[[2026,7]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>We revisit the problem of finding the shortest path between two selected vertices of a graph and formulate this as an \u2010regularized regression\u2014Least Absolute Shrinkage and Selection Operator (lasso). We draw connections between a numerical implementation of this lasso formulation, using the so\u2010called LARS algorithm, and a more established algorithm known as the bi\u2010directional Dijkstra. Appealing features of our formulation include the applicability of the Alternating Direction of Multiplier Method (ADMM) to the problem to identify short paths, and a relatively efficient update to topological changes.<\/jats:p>","DOI":"10.1002\/net.70035","type":"journal-article","created":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:23:21Z","timestamp":1773815001000},"page":"28-41","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Lasso\u2010Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks"],"prefix":"10.1002","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0365-0733","authenticated-orcid":false,"given":"Anqi","family":"Dong","sequence":"first","affiliation":[{"name":"Division of Decision and Control Systems and Department of Mathematics KTH Royal Institute of Technology  Stockholm Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amirhossein","family":"Taghvaei","sequence":"additional","affiliation":[{"name":"Department of Aeronautics and Astronautics University of Washington  Seattle WA USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tryphon T.","family":"Georgiou","sequence":"additional","affiliation":[{"name":"Department of Mechanical and Aerospace Engineering University of California  Irvine CA USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"key":"e_1_2_13_2_1","first-page":"187","article-title":"Le probl\u00e8me Des Labyrinthes","volume":"14","author":"Tarry G.","year":"1895","journal-title":"Nouvelles Annales de Math\u00e9matiques: Journal Des Candidats Aux \u00c9coles Polytechnique et Normale"},{"key":"e_1_2_13_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442865"},{"key":"e_1_2_13_4_1","doi-asserted-by":"crossref","unstructured":"E. N.MortensenandW. A.Barrett \u201cIntelligent Scissors for Image Composition \u201d inProceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques pp. 191\u2013198 1995.","DOI":"10.1145\/218380.218442"},{"key":"e_1_2_13_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"e_1_2_13_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_13_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77615"},{"key":"e_1_2_13_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"e_1_2_13_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/10637199408915459"},{"key":"e_1_2_13_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_2_13_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683268"},{"key":"e_1_2_13_12_1","doi-asserted-by":"crossref","unstructured":"M.Potamias F.Bonchi C.Castillo andA.Gionis \u201cFast Shortest Path Distance Estimation in Large Networks \u201d inProceedings of the 18th ACM Conference on Information and Knowledge Management 2009.","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_2_13_13_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_2_13_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_2_13_15_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_2_13_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/13-EJS815"},{"key":"e_1_2_13_17_1","doi-asserted-by":"crossref","unstructured":"A.Dong A.Taghvaei andT. T.Georgiou \u201cLasso Formulation of the Shortest Path Problem \u201d in2020 59th IEEE Conference on Decision and Control (CDC) pp. 402\u2013407. IEEE 2020.","DOI":"10.1109\/CDC42340.2020.9303909"},{"issue":"3","key":"e_1_2_13_18_1","first-page":"599","article-title":"Dijkstra's Algorithm Revisited: The Dynamic Programming Connexion","volume":"35","author":"Sniedovich M.","year":"2006","journal-title":"Control and Cybernetics"},{"key":"e_1_2_13_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1146567"},{"key":"e_1_2_13_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-981-7"},{"key":"e_1_2_13_21_1","volume-title":"Algorithms, and Applications","author":"Ahuja R. K.","year":"1988"},{"key":"e_1_2_13_22_1","unstructured":"I.Pohl \u201cBidirectional and Heuristic Search in Path Problems \u201d Technical report Technical Report SLAC\u2010104 Stanford Linear Accelerator Center Stanford California 1969."},{"key":"e_1_2_13_23_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"e_1_2_13_24_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2022"},{"key":"e_1_2_13_25_1","unstructured":"S.Boyd N.Parikh E.Chu B.Peleato andJ.Eckstein \u201cMATLAB Scripts for Alternating Direction Method of Multipliers \u201d2011."},{"key":"e_1_2_13_26_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41597-023-02578-1"},{"key":"e_1_2_13_27_1","doi-asserted-by":"crossref","unstructured":"R. A.RossiandN. K.Ahmed \u201cThe Network Data Repository with Interactive Graph Analytics and Visualization \u201d inAAAI 2015.","DOI":"10.1609\/aaai.v29i1.9277"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.70035","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/net.70035","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.70035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:57:47Z","timestamp":1780383467000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.70035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,17]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["10.1002\/net.70035"],"URL":"https:\/\/doi.org\/10.1002\/net.70035","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,17]]},"assertion":[{"value":"2025-07-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}