Name
Abstract | ||
|---|---|---|
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different
from the shortest path, have small stretch, and are locally optimal. We formally define the problem of finding alternative
routes with a single via vertex, develop efficient algorithms for it, and evaluate them experimentally. Our algorithms are
efficient enough for practical use and compare favorably with previous methods in both speed and solution quality.
|
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2444016.2444019 | Workshop on Experimental and Efficient Algorithms |
Keywords | Field | DocType |
road network,practical use,good alternative route,shortest path,efficient enough,previous method,solution quality,efficient algorithm,alternative route,small stretch | Mathematical optimization,Road networks,Route planning,Shortest path problem,Vertex (geometry),Computer science | Journal |
Volume | ISBN | Citations |
18, | 3-642-13192-1 | 31 |
PageRank | References | Authors |
1.60 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ittai Abraham | 1 | 1483 | 89.62 |
| Daniel Delling | 2 | 2049 | 108.90 |
| Andrew V. Goldberg | 3 | 5883 | 676.30 |
| Renato F. Werneck | 4 | 1743 | 84.33 |