Daniel Delling and Renato Werneck
A wide variety of algorithms can answer exact shortest-path queries in real time on continental road networks, but they typically require significant preprocessing effort. Recently, the customizable route planning (CRP) approach has reduced the time to process a new cost function to a fraction of a minute. We reduce customization time even further, by an order of magnitude. This makes it worthwhile even when a single query is to be run, enabling a host of new applications.
|Published in||Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)|