Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing
Journal of Algorithms
Journal of the ACM (JACM)
A Practical Shortest Path Algorithm with Linear Expected Time
SIAM Journal on Computing
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
PHAST: Hardware-Accelerated Shortest Path Trees
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Graph Partitioning with Natural Cuts
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Efficient routing in road networks with turn costs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
VC-dimension and shortest path algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
ESA'11 Proceedings of the 19th European conference on Algorithms
Algorithm engineering for route planning: an update
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Parallel computation of best connections in public transportation networks
Journal of Experimental Algorithmics (JEA)
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Candidate sets for alternative routes in road networks
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Hierarchical hub labelings for shortest paths
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Time-dependent route planning with generalized objective functions
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Noah: a dynamic ridesharing system
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Efficient single-source shortest path and distance queries on large graphs
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Routing directions: keeping it fast and simple
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms for hub label optimization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Optimizing Landmark-Based Routing and Preprocessing
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Flexible route guidance through turn instruction graphs
Proceedings of the 1st ACM SIGSPATIAL International Workshop on MapInteraction
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
Simple, fast, and scalable reachability oracle
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical point-to-point 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 algorithm existed, it has the best time bounds. This paper describes an implementation of the labeling algorithm that is faster than any existing method on continental road networks.