Graph indexing of road networks for shortest path queries with label restrictions

Proceedings of the VLDB Endowment

Volumn 4, Issue 2, 2010, Pages 69-80

  Rice, Michael ^a   Tsotras, Vassilis J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; INDEXING (OF INFORMATION); LOCATION BASED SERVICES; MOTOR TRANSPORTATION; MULTIMODAL TRANSPORTATION; PROBLEM SOLVING; ROADS AND STREETS; TELECOMMUNICATION SERVICES; TRANSPORTATION;

CONSTRAINED SHORTEST PATH; DIJKSTRA'S ALGORITHMS; DYNAMIC CONSTRAINTS; EXPERIMENTAL EVALUATION; INDEXING TECHNIQUES; LARGE-SCALE DATASETS; MULTIMODAL TRANSPORTATION NETWORKS; SHORTEST PATH QUERIES;

GRAPH THEORY;

EID: 79955795942     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1921071.1921074     Document Type: Article

References (16)

1. C. L. Barrett, K. Bisset, M. Holzer, G. Konjevod, M. V. Marathe, and D. Wagner. Engineering label-constrained shortest-path algorithms. In AAIM, pages 27-37, 2008.
2. C. L. Barrett, K. Bisset, R. Jacob, G. Konjevod, and M. V. Marathe. Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the transims router. In ESA, pages 126-138, 2002.
3. C. L. Barrett, R. Jacob, and M. V. Marathe. Formal-language-constrained path problems. SIAM J. Comput., 30(3):809-837, 2000.
4. R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes, and D. Wagner. Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm. In WEA, pages 303-318, 2008.
5. D. Delling and D. Wagner. Landmark-based routing in dynamic graphs. In WEA, pages 52-65, 2007.
6. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
7. R. Geisberger. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. Master's thesis, Institut fur Theoretische Informatik Universitat Karlsruhe, 2008.
8. R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In WEA, pages 319-333, 2008.
9. A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In SODA, pages 156-165, 2005.
10. A. V. Goldberg and R. F. Werneck. Computing point-to-point shortest paths from external memory. In ALENEX/ANALCO, pages 26-40, 2005.
11. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. In IEEE Transactions on System Science and Cybernetics, volume 4, 1968.
12. M. Holzer, F. Schulz, and D. Wagner. Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics, 13, 2008.
13. S. Knopp, P. Sanders, D. Schultes, F. Schulz, and D. Wagner. Computing many-to-many shortest paths using highway hierarchies. In ALENEX, 2007.
14. P. Sanders and D. Schultes. Engineering highway hierarchies. In ESA, pages 804-816, 2006.
15. P. Sanders, D. Schultes, and C. Vetter. Mobile route planning. In ESA, pages 732-743, 2008.
16. D. Schultes and P. Sanders. Dynamic highway-node routing. In WEA, pages 66-79, 2007.