Preprocessing Speed-Up Techniques Is Hard

  title={Preprocessing Speed-Up Techniques Is Hard},
  author={Reinhard Bauer and Tobias Columbus and Bastian Katz and Marcus Krug and Dorothea Wagner},
During the last years, preprocessing-based techniques have been developed to compute shortest paths between two given points in a road network. These speed-up techniques make the computation a matter of microseconds even on huge networks. While there is a vast amount of experimental work in the eld, there is still large demand on theoretical foundations. The preprocessing phases of most speed-up techniques leave open some degree of freedom which, in practice, is lled in a heuristical fashion… CONTINUE READING
Highly Cited
This paper has 49 citations. REVIEW CITATIONS
30 Citations
26 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 26 references


  • M. Hilger
  • K ohler, R. H. M ohring, and H. Schilling…
  • 2009
Highly Influential
5 Excerpts

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

  • U. Lauther
  • In Geoinformation und Mobilit at - von der…
  • 2004
Highly Influential
5 Excerpts

Preprocessing Speed-Up Techniques is Hard

  • R. Bauer, T. Columbus, B. Katz, M. Krug, D. Wagner
  • In Proceedings of the 7th Conference on…
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…