Recent results on the single-source shortest paths problem

Authors:
Rajeev Raman
Affiliations:
Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK
Venue:
ACM SIGACT News
Year:
1997

Citing 0
Cited 24

Experimental analysis of dynamic algorithms for the single source shortest paths problem

Journal of Experimental Algorithmics (JEA)
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Single-source shortest-paths on arbitrary directed graphs in linear average-case time

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computing shortest paths with comparisons and additions

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Shortest Paths on the Word RAM

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Shortest Path Algorithms: Engineering Aspects

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Simple Shortest Path Algorithm with Linear Average Time

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Meldable RAM priority queues and minimum directed spanning trees

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Journal of Computer and System Sciences - Special issue: STOC 2003
Incremental computation of shortest paths in semi-dynamic graphs using software components

Proceedings of the 44th annual Southeast regional conference
Approximate distance oracles for graphs with dense clusters

Computational Geometry: Theory and Applications
A double scaling algorithm for the constrained maximum flow problem

Computers and Operations Research
Studying (non-planar) road networks through an algorithmic lens

Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
An edge-wise linear shortest path algorithm for non negative weighted undirected graphs

Proceedings of the 7th International Conference on Frontiers of Information Technology
Approximate shortest path queries using Voronoi duals

Transactions on computational science IX
Approximate shortest path queries using Voronoi duals

Transactions on computational science IX
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings

SIAM Journal on Computing
Approximate distance oracles for graphs with dense clusters

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
QoS-aware automatic service composition: a graph view

Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We summarize the currently best known theoretical results for the single-source shortest paths problem for directed graphs with non-negative edge weights. We also point out that a recent result due to Cherkassky, Goldberg and Silverstein (1996) leads to even better time bounds for this problem than claimed by the authors.