Historic algorithms help unlock shortest-path problem breakthrough
What’s an application where you’d absolutely have to have a graph with negative weights? Couldn’t you just preprocess the edges and normalize their weights?