Accession Number : ADA322742

Title :   A Heuristic Improvement of the Bellman-Ford Algorithm,

Corporate Author : STANFORD UNIV CA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Goldberg, Andrew ; Radzik, Tomasz

PDF Url : ADA322742

Report Date : MAR 1993

Pagination or Media Count : 7

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 superior in practice.

Descriptors :   *ALGORITHMS, *HEURISTIC METHODS, QUEUEING THEORY, INPUT OUTPUT PROCESSING, APPLIED MATHEMATICS.

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE