Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff

2016/01/05 by Wulff-Nilsen, Christian
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.2.2

paper · doi:10.48550/arxiv.1601.00839

Abstract

We consider approximate distance oracles for edge-weighted n-vertex undirected planar graphs. Given fixed epsilon > 0, we present a (1+epsilon)-approximate distance oracle with O(n(loglog n)²) space and O((loglog n)³) query time. This improves the previous best product of query time and space of the oracles of Thorup (FOCS 2001, J. ACM 2004) and Klein (SODA 2002) from O(n log n) to O(n(loglog n)⁵).

Related

• Optimal Approximate Distance Oracle for Planar Graphs
• More Compact Oracles for Approximate Distances in Planar Graphs
• Constant Query Time (1 + ε)-Approximate Distance Oracle for Planar Graphs
• Almost Optimal Distance Oracles for Planar Graphs
• Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency