Approximate distance oracles with improved bounds

Shiri Chechik

doi:10.1145/2746539.2746562

Approximate distance oracles with improved bounds

Shiri Chechik^*

^*Corresponding author for this work

School of Computer Science

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

Abstract

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 (n^1+1/k) space, guarantees a stretch of 2k-1, and answers any query in only O(1) time.

Original language	English
Title of host publication	STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing
Publisher	Association for Computing Machinery
Pages	1-10
Number of pages	10
ISBN (Electronic)	9781450335362
DOIs	https://doi.org/10.1145/2746539.2746562
State	Published - 14 Jun 2015
Event	47th Annual ACM Symposium on Theory of Computing, STOC 2015 - Portland, United States Duration: 14 Jun 2015 → 17 Jun 2015

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	14-17-June-2015
ISSN (Print)	0737-8017

Conference

Conference	47th Annual ACM Symposium on Theory of Computing, STOC 2015
Country/Territory	United States
City	Portland
Period	14/06/15 → 17/06/15

Keywords

Constant querytime
Distance oracles
Shortest paths

Access to Document

10.1145/2746539.2746562

Cite this

@inproceedings{12d6e8590d1e4605843113be3fda0f2e,

title = "Approximate distance oracles with improved bounds",

abstract = "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.",

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

author = "Shiri Chechik",

year = "2015",

month = jun,

day = "14",

doi = "10.1145/2746539.2746562",

language = "אנגלית",

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

publisher = "Association for Computing Machinery",

pages = "1--10",

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

}

Chechik, S 2015, Approximate distance oracles with improved bounds. in STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. 14-17-June-2015, Association for Computing Machinery, pp. 1-10, 47th Annual ACM Symposium on Theory of Computing, STOC 2015, Portland, United States, 14/06/15. https://doi.org/10.1145/2746539.2746562

Approximate distance oracles with improved bounds. / Chechik, Shiri.
STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, 2015. p. 1-10 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. 14-17-June-2015).

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

TY - GEN

T1 - Approximate distance oracles with improved bounds

AU - Chechik, Shiri

PY - 2015/6/14

Y1 - 2015/6/14

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

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

KW - Constant querytime

KW - Distance oracles

KW - Shortest paths

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

U2 - 10.1145/2746539.2746562

DO - 10.1145/2746539.2746562

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

AN - SCOPUS:84958743972

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

SP - 1

EP - 10

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

PB - Association for Computing Machinery

T2 - 47th Annual ACM Symposium on Theory of Computing, STOC 2015

Y2 - 14 June 2015 through 17 June 2015

ER -

Approximate distance oracles with improved bounds

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this