Distance oracles beyond the Thorup-Zwick bound

Mihai Pǎtraşcu, Liam Roditty

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

64 Scopus citations

Abstract

We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our distance oracle has size O(n5/3) = O(n 1.66⋯) and, when queried about vertices at distance d, returns a path of length 2d + 1. For weighted graphs with m = n2/α edges, our distance oracle has size O(n2/3√α) and returns a factor 2 approximation. Based on a plausible conjecture about the hardness of set intersection queries, we show that a 2-approximate distance oracle requires space Ω(n2/√α). For unweighted graphs, this implies a Ω(n1.5) space lower bound to achieve approximation 2d + 1.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010
PublisherIEEE Computer Society
Pages815-823
Number of pages9
ISBN (Print)9780769542447
DOIs
StatePublished - 2010
Event2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010 - Las Vegas, NV, United States
Duration: 23 Oct 201026 Oct 2010

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Conference

Conference2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010
Country/TerritoryUnited States
CityLas Vegas, NV
Period23/10/1026/10/10

Fingerprint

Dive into the research topics of 'Distance oracles beyond the Thorup-Zwick bound'. Together they form a unique fingerprint.

Cite this