### Faster algorithms for the shortest path problemFaster algorithms for the shortest path problem

Access Restriction
Subscribed

 Author Ahuja, Ravindra K. ♦ Mehlhorn, Kurt ♦ Orlin, James ♦ Tarjan, Robert E. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1990 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the radix heap, is proposed for use in this algorithm. On a network with $\textit{n}$ vertices, $\textit{m}$ edges, and nonnegative integer arc costs bounded by $\textit{C},$ a one-level form of radix heap gives a time bound for Dijkstra's algorithm of $\textit{O}(\textit{m}$ + $\textit{n}$ log $\textit{C}).$ A two-level form of radix heap gives a bound of $\textit{O}(\textit{m}$ + $\textit{n}$ log $\textit{C}/log$ log $\textit{C}).$ A combination of a radix heap and a previously known data structure called a Fibonacci heap gives a bound of $\textit{O}(\textit{m}$ + $\textit{n}a$ @@@@log $\textit{C}).$ The best previously known bounds are $\textit{O}(\textit{m}$ + $\textit{n}$ log $\textit{n})$ using Fibonacci heaps alone and $\textit{O}(\textit{m}$ log log $\textit{C})$ using the priority queue structure of Van Emde Boas et al. [ 17]. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1990-04-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 37 Issue Number 2 Page Count 11 Starting Page 213 Ending Page 223

#### Open content in new tab

Source: ACM Digital Library