DeepAI AI Chat
Log In Sign Up

Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

by   Karl Bringmann, et al.

In this work we revisit the fundamental Single-Source Shortest Paths (SSSP) problem with possibly negative edge weights. A recent breakthrough result by Bernstein, Nanongkai and Wulff-Nilsen established a near-linear O(m log^8(n) log(W))-time algorithm for negative-weight SSSP, where W is an upper bound on the magnitude of the smallest negative-weight edge. In this work we improve the running time to O(m log^2(n) log(nW) loglog n), which is an improvement by nearly six log-factors. Some of these log-factors are easy to shave (e.g. replacing the priority queue used in Dijkstra's algorithm), while others are significantly more involved (e.g. to find negative cycles we design an algorithm reminiscent of noisy binary search and analyze it with drift analysis). As side results, we obtain an algorithm to compute the minimum cycle mean in the same running time as well as a new construction for computing Low-Diameter Decompositions in directed graphs.


page 1

page 2

page 3

page 4


Negative-Weight Single-Source Shortest Paths in Near-linear Time

We present a randomized algorithm that computes single-source shortest p...

Bellman-Ford is optimal for shortest hop-bounded paths

This paper is about the problem of finding a shortest s-t path using at ...

Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights

This paper presents parallel and distributed algorithms for single-sourc...

Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time

In the distributed all-pairs shortest paths problem (APSP), every node ...

Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failures

This paper considers a natural fault-tolerant shortest paths problem: fo...

Faster approximation algorithms for computing shortest cycles on weighted graphs

Given an n-vertex m-edge graph G with non negative edge-weights, the gir...