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.

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.

Mathematics of Operations Research, Vol. 38, No. 2 (May 2013), pp. 209-227 (19 pages) We consider a totally asynchronous stochastic approximation algorithm, Q-learning, for solving finite space ...