One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network ...

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

Military Operations Research, Vol. 14, No. 3 (2009), pp. 31-52 (22 pages) We formulate and solve aircraftrouting problems that arise when planning missions for military aircraft that are subject to ...

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.

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.

They could prove that the algorithm would run quickly if no shortest path passed through too many deleted segments — otherwise, the last step would take too long. But how to decide which segments to ...