Engineering Label-Constrained Shortest-Path Algorithms

Authors:
Chris Barrett;Keith Bisset;Martin Holzer;Goran Konjevod;Madhav Marathe;Dorothea Wagner
Affiliations:
Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech,;Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech,;Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech,;Dept. of Computer Science and Engineering, Arizona State University,;Fakultät für Informatik, Universität Karlsruhe (TH),;Fakultät für Informatik, Universität Karlsruhe (TH),
Venue:
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Year:
2008

Citing 10
Cited 4

Shortest paths in Euclidean graphs

Algorithmica
Shortest path under rational constraint

Information Processing Letters
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Finding Regular Simple Paths in Graph Databases

SIAM Journal on Computing
Graph-theoretic methods in database theory

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A computational study of routing algorithms for realistic transportation networks

Journal of Experimental Algorithmics (JEA)
Formal-Language-Constrained Path Problems

SIAM Journal on Computing
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Time-Dependent, Label-Constrained Shortest Path Problems with Applications

Transportation Science
The approach-dependent, time-dependent, label-constrained shortest path problem

Networks

Engineering Route Planning Algorithms

Algorithmics of Large and Complex Networks
Finding Top-k Approximate Answers to Path Queries

FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Graph indexing of road networks for shortest path queries with label restrictions

Proceedings of the VLDB Endowment
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a generalization of the shortest-path problem: given an alphabet Σ, a graph Gwhose edges are weighted and Σ-labeled, and a regular language L驴 Σ*, the L-constrained shortest-path problemconsists of finding a shortest path pin Gsuch that the concatenated labels along pform a word of L. This definition allows to model, e. g., many traffic-planning problems. We present extensions of well-known speed-up techniques for the standard shortest-path problem, and conduct an extensive experimental study of their performance with various networks and language constraints. Our results show that depending on the network type, both goal-directed and bidirectional search speed up the search considerably, while combinations of these do not.