Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: SPLZ: An Efficient Algorithm for Single Source Shortest Path Problem
  Using Compression Method   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.

34
The categories of this paper are: chem-ph
18
The categories of this paper are: econ
4
The categories of this paper are: cond-mat
28
The categories of this paper are: alg-geom
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci