A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proven that it’s “universally optimal.” ...

Theoretical: Shifts understanding of shortest-path computation for directed graphs. Inspires new research avenues for optimal graph algorithms free from sorting constraints. Provides evidence that ...

We propose an effective algorithm for this problem by adapting efficient existing partitioned shortest path algorithmic schemes to handle time dependency along with the label constraints.

In this note we present some computational evidence to suggest that a version of Bellman's shortest-path algorithm outperforms Treesort-Dijkstra's for a certain class of networks. OR professionals in ...