Engineering Label-Constrained Shortest-Path Algorithms

  • Chris Barrett
  • Keith Bisset
  • Martin Holzer
  • Goran Konjevod
  • Madhav Marathe
  • Dorothea Wagner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5034)

Abstract

We consider a generalization of the shortest-path problem: given an alphabet Σ, a graph G whose edges are weighted and Σ-labeled, and a regular language L ⊆ Σ*, the L-constrained shortest-path problem consists of finding a shortest path p in G such that the concatenated labels along p form 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barrett, C., Birkbigler, K., Smith, L., Loose, V., Beckman, R., Davis, J., Roberts, D., Williams, M.: An operational description of TRANSIMS. Technical report, Los Alamos National Laboratory (1995)Google Scholar
  2. 2.
    Barrett, C.L., Bisset, K., Holzer, M., Konjevod, G., Marathe, M.V., Wagner, D.: Engineering the label-constrained shortest-path algorithm. Technical report, NDSSL, Virginia Tech. (2007)Google Scholar
  3. 3.
    Barrett, C.L., Bisset, K., Jacob, R., Konjevod, G., Marathe, M.V.: Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSIMS router. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 126–138. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Barrett, C.L., Jacob, R., Marathe, M.V.: Formal-language-constrained path problems. SIAM J. Comput. 30(3), 809–837 (2000)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Jacob, R., Marathe, M.V., Nagel, K.: A computational study of routing algorithms for realistic transportation networks. ACM Journal of Experimental Algorithms 4(6) (1999)Google Scholar
  7. 7.
    Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Comput. 24(6), 1235–1258 (1995)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM 37(3), 607–625 (1990)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Romeuf, J.-F.: Shortest path under rational constraint. Information Processing Letters 28, 245–248 (1988)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Sedgewick, R., Vitter, J.S.: Shortest paths in euclidean graphs. Algorithmica 1(1), 31–48 (1986)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Sherali, H.D., Jeenanunta, C., Hobeika, A.G.: Time-dependent, label-constrained shortest path problems with applications. Transportation Science 37(3), 278–293 (2003)CrossRefGoogle Scholar
  12. 12.
    Sherali, H.D., Jeenanunta, C., Hobeika, A.G.: The approach-dependent, time-dependent, label-constrained shortest path problems. Networks 48(2), 57–67 (2006)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Yannakakis, M.: Graph-theoretic methods in database theory. In: PODS, pp. 230–242 (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Chris Barrett
    • 1
  • Keith Bisset
    • 1
  • Martin Holzer
    • 1
  • Goran Konjevod
    • 3
  • Madhav Marathe
    • 2
  • Dorothea Wagner
    • 2
  1. 1.Dept. of Computer Science and Virginia Bioinformatics InstituteVirginia Tech 
  2. 2.Fakultät für InformatikUniversität Karlsruhe (TH) 
  3. 3.Dept. of Computer Science and EngineeringArizona State University 

Personalised recommendations