Time-Dependent Contraction Hierarchies and Approximation
暂无分享,去创建一个
[1] Lanny A. Yeske. Student Research Projects , 1998 .
[2] Dorothea Wagner,et al. Space-Efficient SHARC-Routing , 2010, SEA.
[3] Daniel Delling,et al. Time-Dependent SHARC-Routing , 2008, Algorithmica.
[4] Peter Sanders,et al. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.
[5] Dorothea Wagner,et al. Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126] , 2009, Algorithmics of Large and Complex Networks.
[6] Peter Sanders,et al. Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.
[7] Hiroshi Imai,et al. An optimal algorithm for approximating a piecewise linear function , 1986 .
[8] Giacomo Nannicini,et al. Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks , 2008, ISAAC.
[9] Peter Sanders,et al. Time-Dependent Contraction Hierarchies , 2009, ALENEX.
[10] Ariel Orda,et al. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.
[11] Leo Liberti,et al. Bidirectional A* Search for Time-Dependent Fast Paths , 2008, WEA.