A heuristic improvement of the Bellman-Ford algorithm

✍ Scribed by Andrew V. Goldberg; Tomasz Radzik

• Book ID: 103925491
• Publisher: Elsevier Science
• Year: 1993
• Tongue: English
• Weight: 334 KB
• Volume: 6
• Category: Article
• ISSN: 0893-9659
• DOI: 10.1016/0893-9659(93)90022-f

✦ Synopsis

We describe a new shortest paths algorithm. Our algorithm achieves the same O(nm) worst-case time bound as Bellman-Ford algorithm but is superior in practice.