Search

Efficient solution of the single source shortest path (SSSP) problem on road networks is an important requirement for numerous real-world applications. This paper introduces an algorithm for the SSSP problem using compression method. Owning to precomputing and storing all-pairs shortest path (APSP), the process of solving SSSP problem is a simple lookup of a little data from precomputed APSP and decompression. APSP without compression needs at least 1TB memory for a road network with one million vertices. Our algorithm can compress such an APSP into several GB, and ensure a good performance of decompression. In our experiment on a dataset about Northwest USA (with 1.2 millions vertices), our method can achieve about three orders of magnitude faster than Dijkstra algorithm based on binary heap. [ABSTRACT FROM AUTHOR]

This paper continues the STACS contribution by Diekert, Ushakov, and the author as well as the IJAC publication by the same authors. We extend the results published there in two ways. First, we show that the data structure of power circuits can be generalized to work with arbitrary bases q≥2. This results in a data structure that can hold huge integers, arising by iteratively forming powers of q. We show that the properties of power circuits known for q=2 translate to the general case. This generalization is non-trivial and additional techniques are required to preserve the time bounds of arithmetic operations that were shown for the case q=2. The extended power circuit model permits us to conduct operations in the Baumslag-Solitar group BS(1, q) as efficiently as in BS(1,2). This allows us to solve the word problem in the generalization H(1, q) of Higman's group in polynomial time. The group H(1, q) is an amalgamated product of four copies of the Baumslag-Solitar group BS(1, q) rather than BS(1,2) in the original group H= H(1,2). As a second result, we allow arbitrary numbers f≥4 of copies of BS(1, q), leading to an even more generalized notion of Higman groups H(1, q). We prove that the word problem of the latter can still be solved within the ${\mathcal {O}}(n^{6})$ time bound that was shown for H(1,2). [ABSTRACT FROM AUTHOR]