Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The FastMap Algorithm for Shortest Path Computations   We present a new preprocessing algorithm for embedding the nodes of a given
edge-weighted undirected graph into a Euclidean space. The Euclidean distance
between any two nodes in this space approximates the length of the shortest
path between them in the given graph. Later, at runtime, a shortest path
between any two nodes can be computed with A* search using the Euclidean
distances as heuristic. Our preprocessing algorithm, called FastMap, is
inspired by the data mining algorithm of the same name and runs in near-linear
time. Hence, FastMap is orders of magnitude faster than competing approaches
that produce a Euclidean embedding using Semidefinite Programming. FastMap also
produces admissible and consistent heuristics and therefore guarantees the
generation of shortest paths. Moreover, FastMap applies to general undirected
graphs for which many traditional heuristics, such as the Manhattan Distance
heuristic, are not well defined. Empirically, we demonstrate that A* search
using the FastMap heuristic is competitive with A* search using other
state-of-the-art heuristics, such as the Differential heuristic.

14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
24
The categories of this paper are: dg-ga
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
11
The categories of this paper are: hep-lat
27
The categories of this paper are: comp-gas
32
The categories of this paper are: atom-ph
15
The categories of this paper are: nucl-ex
4
The categories of this paper are: cond-mat
8
The categories of this paper are: hep-ex
36
The categories of this paper are: cmp-lg
19
The categories of this paper are: eess
7
The categories of this paper are: hep-th
17
The categories of this paper are: q-fin