Please use this identifier to cite or link to this item:
doi:10.22028/D291-26129
Title: | Faster algorithms for the shortest path problem |
Author(s): | Ahuja, Ravindra K. Mehlhorn, Kurt Orlin, James B. Tarjan, Robert E. |
Language: | English |
Year of Publication: | 1988 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1988 |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | We investigate efficient implementations of Dijkstra's shortest path algorithm. We propose a new data structure, called the redistributive heap, for use in this algorithm. On a network with n vertices, m edges, and nonnegative integer arc costs bounded by C, a one-level form of redistributive heap gives a time bound for Dijkstra's algorithm of O(m + nlogC). A two-level form of redistributive heap gives a bound of O(m + nlogC/loglogC). A combination of a redistributive heap and a previously known data structure called a Fibonacci heap gives a bound of O(m+ nsqrt{log C}). The best previously known bounds are O(m + nlogn) using Fibonacci heaps alone and O(mloglogC) using the priority queue structure of Van Emde Boas, Kaas, and Zijlstra. |
Link to this record: | urn:nbn:de:bsz:291-scidok-41967 hdl:20.500.11880/26185 http://dx.doi.org/10.22028/D291-26129 |
Series name: | Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes |
Series volume: | 1988/04 |
Date of registration: | 6-Sep-2011 |
Faculty: | MI - Fakultät für Mathematik und Informatik |
Department: | MI - Informatik |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
fb14_1988_04.pdf | 3,38 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.