Name
Abstract | ||
|---|---|---|
We present an algorithm to compute shortest paths on continental road networks with arbitrary metrics (cost functions). The
approach supports turn costs, enables real-time queries, and can incorporate a new metric in a few seconds—fast enough to
support real-time traffic updates and personalized optimization functions. The amount of metric-specific data is a small fraction
of the graph itself, which allows us to maintain several metrics in memory simultaneously.
|
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-20662-7_32 | Workshop on Experimental and Efficient Algorithms |
Keywords | Field | DocType |
small fraction,customizable route planning,real-time query,arbitrary metrics,shortest path,personalized optimization function,continental road network,cost function,real-time traffic updates,turn cost,metric-specific data,real time | Graph,Road networks,Route planning,Computer science,Real-time computing,Oceanography,Distributed computing | Conference |
Volume | ISSN | Citations |
6630 | 0302-9743 | 58 |
PageRank | References | Authors |
1.94 | 23 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Delling | 1 | 2049 | 108.90 |
| Andrew V. Goldberg | 2 | 5883 | 676.30 |
| Thomas Pajor | 3 | 397 | 22.39 |
| Renato F. Werneck | 4 | 1743 | 84.33 |