Computing Many-to-Many Shortest Paths Using Highway Hierarchies
暂无分享,去创建一个
Peter Sanders | Dorothea Wagner | Dominik Schultes | Sebastian Knopp | Frank Schulz | P. Sanders | D. Wagner | Dominik Schultes | F. Schulz | Sebastian Knopp
[1] Frank Schulz,et al. Using Multi-Level Graphs for Timetable Information , 2001 .
[2] Abraham P. Punnen,et al. The traveling salesman problem and its variations , 2007 .
[3] Rolf H. Möhring,et al. Partitioning Graphs to Speed Up Dijkstra's Algorithm , 2005, WEA.
[4] Peter Sanders,et al. Highway Hierarchies Star , 2006, The Shortest Path Problem.
[5] Frank Schulz,et al. High-Performance Multi-Level Graphs ∗ , 2006 .
[6] I-Lin Wang,et al. Shortest paths and multicommodity network flows , 2003 .
[7] Peter Sanders,et al. In Transit to Constant Time Shortest-Path Queries in Road Networks , 2007, ALENEX.
[8] Peter Sanders,et al. Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.
[9] Dorothea Wagner,et al. Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs , 2003, ESA.
[10] Ronald J. Gutman,et al. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.
[11] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[12] Haim Kaplan,et al. Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.
[13] Sebastian Knopp,et al. Efficient Computation of Many-to-Many Shortest Paths , 2006 .