# Lasso formulation of the shortest path problem

@article{Dong2020LassoFO, title={Lasso formulation of the shortest path problem}, author={Anqi Dong and Amirhossein Taghvaei and Tryphon T. Georgiou}, journal={ArXiv}, year={2020}, volume={abs/2005.09152} }

The shortest path problem is formulated as an $l_1$-regularized regression problem, known as lasso. Based on this formulation, a connection is established between Dijkstra's shortest path algorithm and the least angle regression (LARS) for the lasso problem. Specifically, the solution path of the lasso problem, obtained by varying the regularization parameter from infinity to zero (the regularization path), corresponds to shortest path trees that appear in the bi-directional Dijkstra algorithm… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 21 REFERENCES

## Fast shortest path distance estimation in large networks

VIEW 2 EXCERPTS

## Least angle regression

VIEW 2 EXCERPTS

## The lasso problem and uniqueness

VIEW 1 EXCERPT

## Route Planning in Transportation Networks

VIEW 1 EXCERPT

## Regression Shrinkage and Selection via the Lasso

VIEW 2 EXCERPTS

## Routing of multipoint connections

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL