Bellman-Ford is optimal for shortest hop-bounded paths.

Published in: CoRR (2022)

Keyphrases

shortest path
piecewise linear
asymptotically optimal
optimal solution
finding optimal
machine learning
information retrieval
dynamic programming
linear program
closed form
optimal design
optimal path
path length
databases
search space