Approximate distance oracles with constant query time

Shiri Chechik*

*Corresponding author for this work

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

69 Scopus citations

Abstract

An approximate distance oracle is a succinct data structure that provides fast answers to distance queries between any two nodes of a given graph. In this paper we consider approximate distance oracles for general undirected graphs with non-negative edge weights with constant query time. We present a distance oracle of size O(κn1+1/k), with 2κ-1 stretch and O(1) query time. This improves the O(log κ) query time of Wulff-Nilsen's distance oracle [SODA '13], which in turn improved the O(k) query time of Thorup and Zwick's distance oracle [J. ACM '05].

Original languageEnglish
Title of host publicationSTOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing
PublisherAssociation for Computing Machinery
Pages654-663
Number of pages10
ISBN (Print)9781450327107
DOIs
StatePublished - 2014
Externally publishedYes
Event4th Annual ACM Symposium on Theory of Computing, STOC 2014 - New York, NY, United States
Duration: 31 May 20143 Jun 2014

Publication series

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

Conference

Conference4th Annual ACM Symposium on Theory of Computing, STOC 2014
Country/TerritoryUnited States
CityNew York, NY
Period31/05/143/06/14

Keywords

  • Constant querytime
  • Distance oracles
  • Shortest paths

Fingerprint

Dive into the research topics of 'Approximate distance oracles with constant query time'. Together they form a unique fingerprint.

Cite this