Approximate distance oracles with constant query time

Shiri Chechik

doi:10.1145/2591796.2591801

Approximate distance oracles with constant query time

Shiri Chechik^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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(κn^1+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 language	English
Title of host publication	STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing
Publisher	Association for Computing Machinery
Pages	654-663
Number of pages	10
ISBN (Print)	9781450327107
DOIs	https://doi.org/10.1145/2591796.2591801
State	Published - 2014
Externally published	Yes
Event	4th Annual ACM Symposium on Theory of Computing, STOC 2014 - New York, NY, United States Duration: 31 May 2014 → 3 Jun 2014

Publication series

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

Conference

Conference	4th Annual ACM Symposium on Theory of Computing, STOC 2014
Country/Territory	United States
City	New York, NY
Period	31/05/14 → 3/06/14

Keywords

Constant querytime
Distance oracles
Shortest paths

Access to Document

10.1145/2591796.2591801

Cite this

@inproceedings{1bc5509c0d1a41caad9f640a5b0b020f,

title = "Approximate distance oracles with constant query time",

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].",

keywords = "Constant querytime, Distance oracles, Shortest paths",

author = "Shiri Chechik",

year = "2014",

doi = "10.1145/2591796.2591801",

language = "אנגלית",

isbn = "9781450327107",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "654--663",

booktitle = "STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing",

note = "4th Annual ACM Symposium on Theory of Computing, STOC 2014 ; Conference date: 31-05-2014 Through 03-06-2014",

}

Chechik, S 2014, Approximate distance oracles with constant query time. in STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 654-663, 4th Annual ACM Symposium on Theory of Computing, STOC 2014, New York, NY, United States, 31/05/14. https://doi.org/10.1145/2591796.2591801

Approximate distance oracles with constant query time. / Chechik, Shiri.
STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. Association for Computing Machinery, 2014. p. 654-663 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Approximate distance oracles with constant query time

AU - Chechik, Shiri

PY - 2014

Y1 - 2014

N2 - 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].

AB - 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].

KW - Constant querytime

KW - Distance oracles

KW - Shortest paths

UR - http://www.scopus.com/inward/record.url?scp=84904289621&partnerID=8YFLogxK

U2 - 10.1145/2591796.2591801

DO - 10.1145/2591796.2591801

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84904289621

SN - 9781450327107

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 654

EP - 663

BT - STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing

PB - Association for Computing Machinery

T2 - 4th Annual ACM Symposium on Theory of Computing, STOC 2014

Y2 - 31 May 2014 through 3 June 2014

ER -

Approximate distance oracles with constant query time

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this