On the Complexity of Partitioning Graphs for Arc-Flags

Authors

  • Reinhard Bauer
  • Moritz Baum
  • Ignaz Rutter
  • Dorothea Wagner

DOI:

https://doi.org/10.7155/jgaa.00294

Keywords:

shortest paths , arc-flags , search space , preprocessing , complexity , approximation

Abstract

Precomputation of auxiliary data in an additional off-line step is a common approach towards improving the performance of shortest-path queries in large-scale networks. One such technique is the arc-flags algorithm, where the preprocessing involves computing a partition of the input graph. The quality of this partition significantly affects the speed-up observed in the query phase. It is evaluated by considering the search-space size of subsequent shortest-path queries, in particular its maximum or its average over all queries. In this paper, we substantially strengthen existing hardness results of Bauer et al. and show that optimally filling this degree of freedom is NP-hard for trees with unit-length edges, even if we bound the height or the degree. On the other hand, we show that optimal partitions for paths can be computed efficiently and give approximation algorithms for cycles and trees.

Downloads

Download data is not yet available.

Downloads

Published

2013-03-01

How to Cite

Bauer, R., Baum, M., Rutter, I., & Wagner, D. (2013). On the Complexity of Partitioning Graphs for Arc-Flags. Journal of Graph Algorithms and Applications, 17(3), 265–299. https://doi.org/10.7155/jgaa.00294

Issue

Section

Articles

Categories