Name
Abstract | ||
|---|---|---|
We implement and experimentally evaluate landmark-based oracles for min-cost paths in large-scale time-dependent road networks. We exploit parallelism and lossless compression, combined with a novel travel-time approximation technique, to severely reduce preprocessing space and time. We significantly improve the FLAT oracle, improving the previous query time by $30%$ and doubling the Dijkstra-rank speedup. We also implement and experimentally evaluate a novel oracle (HORN), based on a landmark hierarchy, achieving even better performance wrt to FLAT. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1137/1.9781611974317.1 | algorithm engineering and experimentation |
Field | DocType | Volume |
Road networks,Computer science,Oracle,Algorithm,Exploit,Preprocessor,Landmark,Hierarchy,Lossless compression,Speedup | Conference | abs/1511.08303 |
Citations | PageRank | References |
1 | 0.35 | 13 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Spyros Kontogiannis | 1 | 259 | 28.04 |
| George Michalopoulos | 2 | 1 | 0.35 |
| Georgia Papastavrou | 3 | 5 | 1.45 |
| Andreas Paraskevopoulos | 4 | 15 | 3.46 |
| Dorothea Wagner | 5 | 33 | 9.42 |
| Christos D. Zaroliagis | 6 | 656 | 67.76 |