## Abstract

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, subpolynomial or arbitrarily small polynomial factors from the naïve linear space, constant query-time lower bound. These tradeoffs include: (i) an oracle with space O(n^{1}+^{ϵ}) and query-time Õ(1) for any constant ϵ > 0, (ii) an oracle with space Õ(n) and query-time O(n^{ϵ}) for any constant ϵ > 0, and (iii) an oracle with space n^{1}+o(1^{)} and query-time n^{o}(1^{)}.

Original language | English |
---|---|

Title of host publication | STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing |

Editors | Moses Charikar, Edith Cohen |

Publisher | Association for Computing Machinery |

Pages | 138-151 |

Number of pages | 14 |

ISBN (Electronic) | 9781450367059 |

DOIs | |

State | Published - 23 Jun 2019 |

Event | 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 - Phoenix, United States Duration: 23 Jun 2019 → 26 Jun 2019 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

ISSN (Print) | 0737-8017 |

### Conference

Conference | 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 |
---|---|

Country/Territory | United States |

City | Phoenix |

Period | 23/06/19 → 26/06/19 |

### Bibliographical note

Publisher Copyright:© 2019 Association for Computing Machinery.

## Keywords

- Distance oracles
- Planar graphs
- Shortest paths
- Voronoi diagrams

## ASJC Scopus subject areas

- Software