They settled on the negative-weight shortest-paths problem and invited Aaron Bernstein of Rutgers University to join them. Christian Wulff-Nilsen was looking for an ambitious problem to tackle with ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

This paper considers a stochastic shortest path problem where the arc lengths are independent random variables following a normal distribution. In this problem, the optimal path is one that maximizes ...

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

Facts about the single source shortest path problem The aim of the single source shortest path problem is to find the shortest paths from a given starting node to all other nodes in a network.