DeepAI AI Chat
Log In Sign Up

Bellman-Ford is optimal for shortest hop-bounded paths

by   Tomasz Kociumaka, et al.

This paper is about the problem of finding a shortest s-t path using at most h edges in edge-weighted graphs. The Bellman–Ford algorithm solves this problem in O(hm) time, where m is the number of edges. We show that this running time is optimal, up to subpolynomial factors, under popular fine-grained complexity assumptions. More specifically, we show that under the APSP Hypothesis the problem cannot be solved faster already in undirected graphs with non-negative edge weights. This lower bound holds even restricted to graphs of arbitrary density and for arbitrary h ∈ O(√(m)). Moreover, under a stronger assumption, namely the Min-Plus Convolution Hypothesis, we can eliminate the restriction h ∈ O(√(m)). In other words, the O(hm) bound is tight for the entire space of parameters h, m, and n, where n is the number of nodes. Our lower bounds can be contrasted with the recent near-linear time algorithm for the negative-weight Single-Source Shortest Paths problem, which is the textbook application of the Bellman–Ford algorithm.


page 1

page 2

page 3

page 4


A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs

In undirected graphs with real non-negative weights, we give a new rando...

Tight Bound for the Number of Distinct Palindromes in a Tree

For an undirected tree with n edges labelled by single letters, we consi...

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

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

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

In this work we revisit the fundamental Single-Source Shortest Paths (SS...

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Local search is a widely-employed strategy for finding good solutions to...

Factorization and pseudofactorization of weighted graphs

For unweighted graphs, finding isometric embeddings is closely related t...

An Efficient Algorithm for Finding Sets of Optimal Routes

In several important routing contexts it is required to identify a set o...