{"ID":2836118,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2511.22745","arxiv_id":"2511.22745","title":"A lasso-alternative to Dijkstra's algorithm for identifying short paths in networks","abstract":"We revisit the problem of finding the shortest path between two selected vertices of a graph and formulate this as an $\\ell_1$-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.","short_abstract":"We revisit the problem of finding the shortest path between two selected vertices of a graph and formulate this as an $\\ell_1$-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 alg...","url_abs":"https://arxiv.org/abs/2511.22745","url_pdf":"https://arxiv.org/pdf/2511.22745v1","authors":"[\"Anqi Dong\",\"Amirhossein Taghvaei\",\"Tryphon T. Georgiou\"]","published":"2025-11-27T20:30:11Z","proceeding":"math.OC","tasks":"[\"math.OC\",\"cs.DC\",\"cs.SI\",\"eess.IV\"]","methods":"[]","has_code":false}