TY - GEN

T1 - Approximate distance oracles with improved bounds

AU - Chechik, Shiri

N1 - Publisher Copyright:
© Copyright 2015 ACM.

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 -