SHARC: Fast and robust unidirectional routing

@article{Bauer2009SHARCFA,
  title={SHARC: Fast and robust unidirectional routing},
  author={Reinhard Bauer and Daniel Delling},
  journal={ACM Journal of Experimental Algorithmics},
  year={2009},
  volume={14}
}
During recent years, impressive speed-up techniques for Dijkstra's have been developed. Unfortunately, the most advanced techniques use bidirectional search, which makes it hard to use them in scenarios where a backward search is prohibited. Even worse, such scenarios are widely spread (e.g., timetable-information systems or time-dependent networks). In this work, we present a unidirectional speed-up technique, which competes with bidirectional approaches. Moreover, we show how to exploit the… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 200 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

201 Citations

0102030'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 201 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix Ordering Package

  • F. Pellegrini
  • 2007
Highly Influential
7 Excerpts

An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background

  • U. Lauther
  • Geoinformation und Mobilität - von der Forschung…
  • 2004
Highly Influential
7 Excerpts

METIS - Family of Multilevel Partitioning Algorithms

  • G. Karypis
  • 2007
Highly Influential
5 Excerpts

The Shortest Route Through a Network with Time-Dependent Intermodal Transit Times

  • K. Cooke, E. Halsey
  • Journal of Mathematical Analysis and Applications…
  • 1966
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…