Fast and accurate estimation of shortest paths in large graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Fast routing in very large public transportation networks using transfer patterns
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Contraction of timetable networks with realistic transfers
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Parallel computation of best connections in public transportation networks
Journal of Experimental Algorithmics (JEA)
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
CrowdRoute: a crowd-sourced routing algorithm in public transit networks
Proceedings of the Second ACM SIGSPATIAL International Workshop on Crowdsourced and Volunteered Geographic Information
| Hi-index | 0.00 |
There are two kinds of people: those who travel by car, and those who use public transport. The topic of this article is to show that the algorithmic problem of computing the fastest way to get from A to B is also surprisingly different on road networks than on public transportation networks.On road networks, even very large ones like that of the whole of Western Europe, the shortest path from a given source to a given target can be computed in just a few microseconds. Lots of interesting speed-up techniques have been developed to this end, and we will give an overview over the most important ones.Public transportation networks can be modeled as graphs just like road networks, and most algorithms designed for road networks can be applied for public transportation networks as well. They just happen to perform not nearly as well, and to date we do not know how to route similarly fast on large public transportation networks as we can on large road networks.The reasons for this are interesting and non-obvious, and it took us a long time to fully comprehend them. Once understood, they are relatively easy to explain, however, and that is what we want to do in this article. Oh, and by the way, happy birthday, Kurt!