Is Timetabling Routing Always Reliable for Public Transport?
暂无分享,去创建一个
[1] Matthias Müller-Hannemann,et al. Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected , 2009, ATMOS.
[2] Peter Sanders,et al. Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.
[3] Matthias Müller-Hannemann,et al. Stochastic Delay Prediction in Large Train Networks , 2011, ATMOS.
[4] Bastian Katz,et al. Parallel computation of best connections in public transportation networks , 2010, IPDPS.
[5] Ronald J. Gutman,et al. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.
[6] Andrew V. Goldberg. The Hub Labeling Algorithm , 2013, SEA.
[7] P. Abbeel,et al. Path and travel time inference from GPS probe vehicle data , 2009 .
[8] Matthias Müller-Hannemann,et al. Efficient Timetable Information in the Presence of Delays , 2009, Robust and Online Large-Scale Optimization.
[9] Amos Fiat,et al. Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.
[10] Daniel Delling,et al. Round-Based Public Transit Routing , 2015 .
[11] Hannah Bast,et al. Car or Public Transport - Two Worlds , 2009, Efficient Algorithms.
[12] Christos D. Zaroliagis,et al. Timetable Information: Models and Algorithms , 2004, ATMOS.
[13] Matthias Müller-Hannemann,et al. The Price of Robustness in Timetable Information , 2011, ATMOS.
[14] Haris N. Koutsopoulos,et al. Travel time estimation for urban road networks using low frequency probe vehicle data , 2013, Transportation Research Part B: Methodological.
[15] Ben Strasser,et al. Intriguingly Simple and Fast Transit Routing , 2013, SEA.
[16] Haris N. Koutsopoulos,et al. Travel Time Estimation for Urban Road Networks Using Low-Frequency GPS Probes , 2012 .
[17] Robert Geisberger. Contraction of Timetable Networks with Realistic Transfers , 2010, SEA.
[18] Christos D. Zaroliagis,et al. Efficient models for timetable information in public transportation systems , 2008, JEAL.
[19] Haim Kaplan,et al. Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.
[20] Guangzhong Sun,et al. Driving with knowledge from the physical world , 2011, KDD.
[21] M. Kendall. A NEW MEASURE OF RANK CORRELATION , 1938 .
[22] A. Agresti,et al. Analysis of Ordinal Categorical Data. , 1985 .
[23] Amos Fiat,et al. VC-Dimension and Shortest Path Algorithms , 2011, ICALP.
[24] Erik Carlsson,et al. Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns , 2010, ESA.
[25] Peter Sanders,et al. Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.
[26] Peter Sanders,et al. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.
[27] Peter Sanders,et al. In Transit to Constant Time Shortest-Path Queries in Road Networks , 2007, ALENEX.
[28] Yann Disser,et al. Multi-criteria Shortest Paths in Time-Dependent Train Networks , 2008, WEA.