Multidimensional binary search trees used for associative searching
Communications of the ACM
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Car or Public Transport--Two Worlds
Efficient Algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Multi-criteria shortest paths in time-dependent train networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Fast routing in very large public transportation networks using transfer patterns
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Graph indexing of road networks for shortest path queries with label restrictions
Proceedings of the VLDB Endowment
Crowdsourcing systems on the World-Wide Web
Communications of the ACM
Friendship and mobility: user movement in location-based social networks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
Most existing algorithms assume that public transit networks are static. However in reality, a bus may be delayed or canceled, which causes routing algorithms to generate non-optimal journeys. We propose CrowdRoute, an algorithm that exploits real-time information contributed by the crowd, to solve the earliest arrival problem in public transit networks.