Approximate distance oracles for planar graphs with improved query time-space tradeoff
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
We consider approximate distance oracles for edge-weighted n-vertex undirected planar graphs. Given fixed ϵ > 0, we present a (1 + ϵ)-approximate distance oracle with O(n(log log n)2) space and O((loglogr?,)3) 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(nlogn) to O(n(loglogn)5).
| Original language | English |
|---|---|
| Title of host publication | 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016 |
| Editors | Robert Krauthgamer |
| Number of pages | 12 |
| Publisher | Association for Computing Machinery |
| Publication date | 2016 |
| Pages | 351-362 |
| ISBN (Electronic) | 978-1-61197-433-1 |
| DOIs | |
| Publication status | Published - 2016 |
| Event | 27th Annual ACM-SIAM Symposium on Discrete Algorithms - Arlington, United States Duration: 10 Jan 2016 → 12 Jan 2016 |
Conference
| Conference | 27th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| Land | United States |
| By | Arlington |
| Periode | 10/01/2016 → 12/01/2016 |
ID: 168285424