Results 1  10
of
7,114
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
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
Reach for A∗: Shortest Path Algorithms with Preprocessing
 DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 2009
"... We study the pointtopoint shortest path problem with preprocessing. Given an input graph, we preprocess it so as to be able to answer a series of sourcetodestination queries efficiently. Our work is motivated by an algorithm of Gutman [ALENEX’04], based on the notion of reach, which measures ho ..."
Abstract

Cited by 21 (12 self)
 Add to MetaCart
We study the pointtopoint shortest path problem with preprocessing. Given an input graph, we preprocess it so as to be able to answer a series of sourcetodestination queries efficiently. Our work is motivated by an algorithm of Gutman [ALENEX’04], based on the notion of reach, which measures
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
Better landmarks within reach
 IN THE 9TH DIMACS IMPLEMENTATION CHALLENGE: SHORTEST PATHS
, 2007
"... We present significant improvements to a practical algorithm for the pointtopoint shortest path problem on road networks that combines A∗ search, landmarkbased lower bounds, and reachbased pruning. Through reachaware landmarks, better use of cache, and improved algorithms for reach computation ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
We present significant improvements to a practical algorithm for the pointtopoint shortest path problem on road networks that combines A∗ search, landmarkbased lower bounds, and reachbased pruning. Through reachaware landmarks, better use of cache, and improved algorithms for reach
Incorporating Human Relationships Into Path Planning
"... While pathfinding is ubiquitous in games, it is most often abstracted away from everything else that is going on in the game and viewed as a simple pointtopoint shortest path problem. The notable exception to this is work on tactical pathfinding. Tactical pathfinding incorporates tactical eleme ..."
Abstract
 Add to MetaCart
While pathfinding is ubiquitous in games, it is most often abstracted away from everything else that is going on in the game and viewed as a simple pointtopoint shortest path problem. The notable exception to this is work on tactical pathfinding. Tactical pathfinding incorporates tactical ele
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
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
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
Results 1  10
of
7,114