A heuristic improvement of the Bellman-Ford algorithm

DOI10.1016/0893-9659(93)90022-FzbMath0771.68091WikidataQ128081755 ScholiaQ128081755MaRDI QIDQ2367969

Andrew V. Goldberg, Tomasz Radzik

Publication date: 19 August 1993

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

shortest paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Efficient transitive closure of sparse matrices over closed semirings ⋮ Shortest paths algorithms: Theory and experimental evaluation ⋮ Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs ⋮ An efficient label setting/correcting shortest path algorithm ⋮ A combinatorial algorithm for Horn programs ⋮ On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection ⋮ Engineering Negative Cycle Canceling for Wind Farm Cabling ⋮ Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On a routing problem
• Shortest‐path methods: Complexity, interrelations and new propositions
• Properties of Labeling Methods for Determining Shortest Path Trees
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Fibonacci heaps and their uses in improved network optimization algorithms