Time-Dependent Contraction Hierarchies
暂无分享,去创建一个
Peter Sanders | Daniel Delling | Gernot Veit Batz | Christian Vetter | P. Sanders | D. Delling | C. Vetter | G. V. Batz
[1] Peter Sanders,et al. Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas , 2008, ArXiv.
[2] Peter Sanders,et al. Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.
[3] Peter Sanders,et al. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.
[4] Leo Liberti,et al. Bidirectional A* Search for Time-Dependent Fast Paths , 2008, WEA.
[5] Peter Sanders,et al. Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.
[6] Giacomo Nannicini,et al. Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks , 2008, ISAAC.
[7] Peter Sanders,et al. Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm , 2008, JEAL.
[8] Rolf H. Möhring,et al. Acceleration of Shortest Path and Constrained Shortest Path Computation , 2005, WEA.
[9] Dominik Schultes,et al. Route Planning in Road Networks , 2008 .
[10] Daniel Delling,et al. Time-Dependent SHARC-Routing , 2008, Algorithmica.
[11] Daniel Delling,et al. Engineering and Augmenting Route Planning Algorithms , 2009 .
[12] Daniel Delling,et al. SHARC: Fast and robust unidirectional routing , 2008, JEAL.
[13] Peter Sanders,et al. Fast Routing in Road Networks with Transit Nodes , 2007, Science.
[14] K. Cooke,et al. The shortest route through a network with time-dependent internodal transit times , 1966 .
[15] Robert L. Smith,et al. Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..