There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Rozhoň suggested they try to devise a universally optimal algorithm for the single-source shortest-paths problem. “I said, ‘No, but that’s not possible; that just cannot be done ...