A HEURISTIC IMPROVEMENT OF THE BELLMAN-FORD ALGORITHM

Authors
GOLDBERG AV RADZIK T
Citation
Av. Goldberg et T. Radzik, A HEURISTIC IMPROVEMENT OF THE BELLMAN-FORD ALGORITHM, Applied mathematics letters, 6(3), 1993, pp. 3-6
Citations number
12
Categorie Soggetti
Mathematics,Mathematics
Journal title
Applied mathematics letters → ACNP
ISSN journal
08939659
Volume
6
Issue
3
Year of publication
1993
Pages
3 - 6
Database
ISI
SICI code
0893-9659(1993)6:3<3:AHIOTB>2.0.ZU;2-#
Abstract
We describe a new shortest paths algorithm. Our algorithm achieves the same O(nm) worst-case time bound as Bellman-Ford algorithm but is sup erior in practice.