Approximate distance oracles with improved bounds

Shiri Chechik*

*Corresponding author for this work

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


A distance oracle is a compact data structure capable of quickly estimating distances in a given graph. In this paper we provide a new construction for distance oracles in general undirected weighted graphs. Our data structure, for any integer k, requires O (n1+1/k) space, guarantees a stretch of 2k-1, and answers any query in only O(1) time.

Original languageEnglish
Title of host publicationSTOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing
PublisherAssociation for Computing Machinery
Number of pages10
ISBN (Electronic)9781450335362
StatePublished - 14 Jun 2015
Event47th Annual ACM Symposium on Theory of Computing, STOC 2015 - Portland, United States
Duration: 14 Jun 201517 Jun 2015

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017


Conference47th Annual ACM Symposium on Theory of Computing, STOC 2015
Country/TerritoryUnited States


  • Constant querytime
  • Distance oracles
  • Shortest paths


Dive into the research topics of 'Approximate distance oracles with improved bounds'. Together they form a unique fingerprint.

Cite this