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

The computation of point-to-point shortest paths on time-dependent transportation networks has many practical applications. Finding the shortest path on transportation networks, taking into account ...

Mireta wants to translate slime mold’s superpowers into algorithms that might help improve transit times, alleviate congestion, and more.

This paper considers the shortest path problem with waiting costs (SPWC) as an extension to the shortest path problem with time windows. The problem consists of finding the minimum cost path in a ...

In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most of distributed and parallel graph algorithms in the MPC model are designed for static ...