Approximate distance oracles for planar graphs with improved query time-space tradeoff
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
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).
| Originalsprog | Engelsk |
|---|---|
| Titel | 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016 |
| Redaktører | Robert Krauthgamer |
| Antal sider | 12 |
| Forlag | Association for Computing Machinery |
| Publikationsdato | 2016 |
| Sider | 351-362 |
| ISBN (Elektronisk) | 978-1-61197-433-1 |
| DOI | |
| Status | Udgivet - 2016 |
| Begivenhed | 27th Annual ACM-SIAM Symposium on Discrete Algorithms - Arlington, USA Varighed: 10 jan. 2016 → 12 jan. 2016 |
Konference
| Konference | 27th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| Land | USA |
| By | Arlington |
| Periode | 10/01/2016 → 12/01/2016 |
ID: 168285424