Scipediacontent: Scipediacontent moved page Draft Content 111339844 to Papastavrou et al 2015a

2021-02-01T23:11:38Z

Scipediacontent moved page Draft Content 111339844 to Papastavrou et al 2015a

Scipediacontent: Created page with " == Abstract == We implement and experimentally evaluate landmark-based oracles for min-cost paths in large-scale time-dependent road networks. We exploit parallelism and los..."

2021-02-01T23:11:33Z

Created page with " == Abstract == We implement and experimentally evaluate landmark-based oracles for min-cost paths in large-scale time-dependent road networks. We exploit parallelism and los..."

New page

== 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.

Comment: In ALENEX 2016

== Original document ==

The different versions of the original document can be found in:

* [http://arxiv.org/abs/1511.08303 http://arxiv.org/abs/1511.08303]

* [http://arxiv.org/pdf/1511.08303 http://arxiv.org/pdf/1511.08303]

* [http://epubs.siam.org/doi/pdf/10.1137/1.9781611974317.1 http://epubs.siam.org/doi/pdf/10.1137/1.9781611974317.1],
: [http://dx.doi.org/10.1137/1.9781611974317.1 http://dx.doi.org/10.1137/1.9781611974317.1]

* [https://dblp.uni-trier.de/db/journals/corr/corr1511.html#KontogiannisMPP15 https://dblp.uni-trier.de/db/journals/corr/corr1511.html#KontogiannisMPP15],
: [https://epubs.siam.org/doi/pdf/10.1137/1.9781611974317.1 https://epubs.siam.org/doi/pdf/10.1137/1.9781611974317.1],
: [https://epubs.siam.org/doi/10.1137/1.9781611974317.1 https://epubs.siam.org/doi/10.1137/1.9781611974317.1],
: [https://academic.microsoft.com/#/detail/2963732503 https://academic.microsoft.com/#/detail/2963732503]

← Older revision	Revision as of 23:11, 1 February 2021
(No difference)

Papastavrou et al 2015a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 111339844 to Papastavrou et al 2015a

Scipediacontent: Created page with " == Abstract == We implement and experimentally evaluate landmark-based oracles for min-cost paths in large-scale time-dependent road networks. We exploit parallelism and los..."