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.

It is known that minimum cost flow problems can be solved by successive augmentations along shortest paths. In this paper the issues of implementing shortest path algorithms in this context are ...

The Ant Colony Optimization (ACO) algorithm is a metaheuristic nature-inspired technique for solving various combinatorial optimization problems. The shortest-path problem is an important ...

The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.

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 ...

Yesterday the IEEE announced an update to the 802.11 WiFi standard, and today it's promptly moving on to the Ethernet side of things. The association just approved the 802.1aq Shortest Path ...

Starting with a matching problem, we will first discuss the three central tasks of algorithm design: correctness, termination, and efficiency. Following a similar design process, we will design ...

Also known as Shortest Path Bridging (SPB), the standard will help dramatically reduce the complexity of Ethernet networks while increasing their scale.