A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Almost Optimal Distance Oracles for Planar Graphs
[article]
2018
arXiv
pre-print
Preserved Fulltext
We present new tradeoffs between space and query-time for exact distance oracles in directed weighted planar graphs. These tradeoffs are almost optimal in the sense that they are within polylogarithmic, sub-polynomial or arbitrarily small polynomial factors from the naïve linear space, constant query-time lower bound. These tradeoffs include: (i) an oracle with space Õ(n^1+ϵ) and query-time Õ(1) for any constant ϵ>0, (ii) an oracle with space Õ(n) and query-time Õ(n^ϵ) for any constant ϵ>0, and
arXiv:1811.01551v1
fatcat:zdfayqwq3ffszhojt4uudnamsu