Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths.

Tomasz Kociumaka Adam Polak

Published in: ESA (2023)

Keyphrases

shortest path
piecewise linear
optimal path
optimal design
worst case
path length
asymptotically optimal
real time
closed form
linear program
dynamic programming
mobile robot
multi objective
data structure
path finding
optimal solution
information retrieval