A heuristic improvement of the Bellman-Ford algorithm
From MaRDI portal
Publication:2367969
DOI10.1016/0893-9659(93)90022-FzbMATH Open0771.68091WikidataQ128081755 ScholiaQ128081755MaRDI QIDQ2367969FDOQ2367969
Authors: Andrew V. Goldberg, Tomasz Radzik 
Publication date: 19 August 1993
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- A note on two problems in connexion with graphs
- On a routing problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shortest‐path methods: Complexity, interrelations and new propositions
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- Properties of Labeling Methods for Determining Shortest Path Trees
- Title not available (Why is that?)
Cited In (10)
- Efficient transitive closure of sparse matrices over closed semirings
- An efficient label setting/correcting shortest path algorithm
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
- A combinatorial algorithm for Horn programs
- On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
- Randomized Speedup of the Bellman–Ford Algorithm
- Hybrid Bellman-Ford-Dijkstra algorithm
- Engineering Negative Cycle Canceling for Wind Farm Cabling
- Shortest paths algorithms: Theory and experimental evaluation
This page was built for publication: A heuristic improvement of the Bellman-Ford algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367969)
