Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: ParetoPrep: Fast computation of Path Skylines Queries   Computing cost optimal paths in network data is a very important task in many
application areas like transportation networks, computer networks or social
graphs. In many cases, the cost of an edge can be described by various cost
criteria. For example, in a road network possible cost criteria are distance,
time, ascent, energy consumption or toll fees. In such a multicriteria network,
a route or path skyline query computes the set of all paths having pareto
optimal costs, i.e. each result path is optimal for different user preferences.
In this paper, we propose a new method for computing route skylines which
significantly decreases processing time and memory consumption. Furthermore,
our method does not rely on any precomputation or indexing method and thus, it
is suitable for dynamically changing edge costs. Our experiments demonstrate
that our method outperforms state of the art approaches and allows highly
efficient path skyline computation without any preprocessing.

19
The categories of this paper are: eess
0
The categories of this paper are: hep-ph
11
The categories of this paper are: hep-lat
4
The categories of this paper are: cond-mat
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
31
The categories of this paper are: ao-sci
3
The categories of this paper are: physics
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
18
The categories of this paper are: econ
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph