A Lasso‐Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks
Networks · 2026-07 · 88 (1) · 28-41
DOI: 10.1002/net.70035 ↗At a glance
Journal article in Networks, published online on 2026-03-17. Written by Anqi Dong and 2 co-authors. Cited 1 times so far (Crossref); 26 references. Funded by: Army Research Office, National Science Foundation, Air Force Research Laboratory.
Abstract (original language)
We revisit the problem of finding the shortest path between two selected vertices of a graph and formulate this as an ‐regularized regression—Least Absolute Shrinkage and Selection Operator (lasso). We draw connections between a numerical implementation of this lasso formulation, using the so‐called LARS algorithm, and a more established algorithm known as the bi‐directional 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.
Funding
- Army Research Office
- National Science Foundation
- Air Force Research Laboratory
Cite
APA
Dong, A., Taghvaei, A., & Georgiou, T. T. (2026). A Lasso‐Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks. Networks, 88(1), 28-41. https://doi.org/10.1002/net.70035
Vancouver
Dong A, Taghvaei A, Georgiou TT. A Lasso‐Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks. Networks. 2026;88(1):28-41. doi:10.1002/net.70035
BibTeX
@article{Dong2026,
author = {Dong, Anqi and Taghvaei, Amirhossein and Georgiou, Tryphon T.},
title = {A Lasso‐Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks},
journal = {Networks},
year = {2026},
volume = {88},
number = {1},
pages = {28--41},
doi = {10.1002/net.70035}
}
EUVIMED