Preprocessing speed-up techniques is hard

  • Authors:

  • Reinhard Bauer;Tobias Columbus;Bastian Katz;Marcus Krug;Dorothea Wagner

  • Affiliations:

  • Faculty of Informatics, Karlsruhe Institute of Technology (KIT);Faculty of Informatics, Karlsruhe Institute of Technology (KIT);Faculty of Informatics, Karlsruhe Institute of Technology (KIT);Faculty of Informatics, Karlsruhe Institute of Technology (KIT);Faculty of Informatics, Karlsruhe Institute of Technology (KIT)

  • Venue:
  • CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 field, 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 filled in a heuristical fashion. Thus, for a given speed-up technique, the problem arises of how to fill the according degree of freedom optimally. Until now, the complexity status of these problems was unknown. In this work, we answer this question by showing NP-hardness for the recent techniques.