The FastMap Algorithm for Shortest Path Computations
international joint conference on artificial intelligence, pp. 1427-1433, 2018.
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 comput...More
PPT (Upload PPT)