## Combining Speed-Up Techniques for Shortest-Path Computations (2004)

### Cached

### Download Links

- []
- [i11www.ira.uka.de]
- [i11www.iti.uni-karlsruhe.de]
- DBLP

### Other Repositories/Bibliography

by
Martin Holzer
,
Frank Schulz
,
Thomas Willhalm

Venue: | In Proc. 3rd Workshop on Experimental and Efficient Algorithms. LNCS |

Citations: | 20 - 6 self |

### BibTeX

@INPROCEEDINGS{Holzer04combiningspeed-up,

author = {Martin Holzer and Frank Schulz and Thomas Willhalm},

title = {Combining Speed-Up Techniques for Shortest-Path Computations},

booktitle = {In Proc. 3rd Workshop on Experimental and Efficient Algorithms. LNCS},

year = {2004},

pages = {269--284},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Computing a shortest path from one node to another in a directed graph is a very common task in practice. This problem is classically solved by Dijkstra's algorithm. Many techniques are known to speed up this algorithm heuristically, while optimality of the solution can still be guaranteed. In most studies, such techniques are considered individually.