Results 1  10
of
18,249
PointtoPoint Shortest Path Algorithms with Preprocessing
"... This is a survey of some recent results on pointtopoint shortest path algorithms. This classical optimization problem received a lot of attention lately and significant progress has been made. After an overview of classical results, we study recent heuristics that solve the problem while examinin ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
This is a survey of some recent results on pointtopoint shortest path algorithms. This classical optimization problem received a lot of attention lately and significant progress has been made. After an overview of classical results, we study recent heuristics that solve the problem while
Reach for A∗: Efficient PointtoPoint Shortest Path Algorithms
, 2006
"... We study the pointtopoint shortest path problem in a setting where preprocessing is allowed. We improve the reachbased approach of Gutman [17] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs to reduce v ..."
Abstract

Cited by 77 (6 self)
 Add to MetaCart
We study the pointtopoint shortest path problem in a setting where preprocessing is allowed. We improve the reachbased approach of Gutman [17] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs to reduce
Computing PointtoPoint Shortest Paths from External Memory
"... We study the ALT algorithm [19] for the pointtopoint shortest path problem in the context of road networks. We suggest improvements to the algorithm itself and to its preprocessing stage. We also develop a memoryefficient implementation of the algorithm that runs on a Pocket PC. It stores graph d ..."
Abstract

Cited by 54 (6 self)
 Add to MetaCart
We study the ALT algorithm [19] for the pointtopoint shortest path problem in the context of road networks. We suggest improvements to the algorithm itself and to its preprocessing stage. We also develop a memoryefficient implementation of the algorithm that runs on a Pocket PC. It stores graph
PointtoPoint Shortest Paths on Dynamic TimeDependent Road Networks
, 2009
"... The computation of pointtopoint shortest paths on timedependent road networks has many practical applications which are interesting from an industrial point of view. Typically, users are interested in the path leading to their destination which has the smallest travel time among all possible path ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The computation of pointtopoint shortest paths on timedependent road networks has many practical applications which are interesting from an industrial point of view. Typically, users are interested in the path leading to their destination which has the smallest travel time among all possible
Fast pointtopoint shortest path computations with arcflags
 IN: 9TH DIMACS IMPLEMENTATION CHALLENGE [29
, 2006
"... We present a number of improvements of the basic variant of the arcflag acceleration (Lauther, 1997, 2004) for pointtopoint (P2P) shortest path computations on large graphs. Arcflags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during s ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We present a number of improvements of the basic variant of the arcflag acceleration (Lauther, 1997, 2004) for pointtopoint (P2P) shortest path computations on large graphs. Arcflags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during
An Experimental Evaluation of PointToPoint Shortest Path Calculation on Roadnetworks
, 2006
"... We present an efficient algorithm for fast and exact calculation of shortest paths in graphs with geometrical information in nodes (coordinates), e.g. road networks. The method is based on preprocessing and therefore best suited for static graphs, i.e., graphs with fixed topology and edge costs. In ..."
Abstract
 Add to MetaCart
We present an efficient algorithm for fast and exact calculation of shortest paths in graphs with geometrical information in nodes (coordinates), e.g. road networks. The method is based on preprocessing and therefore best suited for static graphs, i.e., graphs with fixed topology and edge costs
A HubBased Labeling Algorithm for Shortest Paths on Road Networks
, 2010
"... Abstract. Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical pointtopoint shortest path algorithms based on modeling road networks as graphs with low highway dimension. They also analyze a labeling algorithm. While no practical implementation of this a ..."
Abstract

Cited by 48 (17 self)
 Add to MetaCart
Abstract. Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical pointtopoint shortest path algorithms based on modeling road networks as graphs with low highway dimension. They also analyze a labeling algorithm. While no practical implementation
VCdimension and shortest path algorithms
"... We explore the relationship between VCdimension and graph algorithm design. In particular, we show that set systems induced by sets of vertices on shortest paths have VCdimension at most two. This allows us to use a result from learning theory to improve time bounds on query algorithms for the p ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
for the pointtopoint shortest path problem in networks of low highway dimension, such as road networks. We also refine the definitions of highway dimension and related concepts, making them more general and potentially more relevant to practice. In particular, we define highway dimension in terms of set
Approximate Shortest Path Queries Using Voronoi Duals
, 2009
"... We propose an approximation method to answer pointtopoint shortest path queries in undirected edgeweighted graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated as the Voronoi ..."
Abstract
 Add to MetaCart
We propose an approximation method to answer pointtopoint shortest path queries in undirected edgeweighted graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated
Results 1  10
of
18,249