Formal-Language-Constrained Path Problems
SIAM Journal on Computing
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
Engineering Label-Constrained Shortest-Path Algorithms
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
WEA'08 Proceedings of the 7th 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
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Route planning with flexible edge restrictions
Journal of Experimental Algorithmics (JEA)
Shortest path and distance queries on road networks: an experimental evaluation
Proceedings of the VLDB Endowment
Traffic aware route planning in dynamic road networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Chromatic correlation clustering
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
A label correcting algorithm for the shortest path problem on a multi-modal route network
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
The exact distance to destination in undirected world
The VLDB Journal — The International Journal on Very Large Data Bases
Shortest path and distance queries on road networks: towards bridging theory and practice
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
CrowdRoute: a crowd-sourced routing algorithm in public transit networks
Proceedings of the Second ACM SIGSPATIAL International Workshop on Crowdsourced and Volunteered Geographic Information
Efficient processing of label-constraint reachability queries in large graphs
Information Systems
Hi-index | 0.00 |
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path query type in which dynamic constraints may be placed on the allowable set of edges that can appear on a valid shortest path (e.g., dynamically restricting the type of roads or modes of travel which may be considered in a multimodal transportation network). We formalize this problem as a specific variant of formal language constrained shortest path problems, which we call the Kleene Language Constrained Shortest Paths problem. To efficiently support this type of dynamically constrained shortest path query for large-scale datasets, we extend the hierarchical graph indexing technique known as Contraction Hierarchies. Our experimental evaluation using the North American road network dataset (with over 50 million edges) shows an average query speed and search space improvement of over 3 orders of magnitude compared to the naïve adaptation of the standard Dijkstra's algorithm to support this query type. We also show an improvement of over 2 orders of magnitude compared to the only previously-existing indexing technique which could solve this problem without additional preprocessing.