Answers are grounded in this paper and cite their sources.
We describe a new method for designing scaling algorithms for the single-source shortest paths problem and use this method to obtain an O(√nm log N) algorithm for the problem. (Here n and m are the number of nodes and arcs in the input network and N is essentially the absolute value of the most negative arc length; arc lengths are assumed to be integral.) This improves previous bounds for the problem. The method extends to related problems.
No takes yet. Share an insight, caveat, or question.
Andrew V. Goldberg (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: