Jonker, R. and Volgenant, A. (1987) A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing, 38, 325-340.

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.

The Travelling Salesperson Problem a combinatorial optimization problem and one of the most intensively studied puzzles in mathematics. The challenge is to find the shortest route that visits every ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Journal Reference: Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen. Negative-Weight Single-Source Shortest Paths in Near-linear Time. arXiv.org, 2022; DOI: 10.48550/arXiv.2203.03456 ...

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra ...

Arising from the need of all time for optimization of irrigation systems, distribution network and cable network, the Cluster Shortest Path Tree Problem (CSTP) has been attracting a lot of attention ...