Distance labels with optimal local stretch

Ittai Abraham, Shiri Chechik

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

2 Scopus citations

Abstract

This paper studies distance oracles and distance labeling scheme with local stretch. Informally we would like to provide stretch guarantees for the r closest nodes of each node. A distance oracle has local stretch k for r neighborhoods if for any u,v such that v = M(u,r′) and r′ ≤ r: dist(u, v) ≤ dĩst (u, v) ≤ kdist(u, v), where M(u,r′) is the r′ closest node to u and is the estimated distance returned by the distance oracle. For parameters r > 1, k > 1, we obtain labels of size O(r1/k ln1 - 1/k r + ln k), with local stretch of 2k - 1 for r neighborhoods in O(k) time, significantly improving the query time and stretch constant of [ABN09]. Moreover, our stretch guarantee of 2k - 1 matches the best known (and conjectured optimal) guarantees of standard distance oracles.

Original languageEnglish
Title of host publicationAutomata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings
PublisherSpringer Verlag
Pages52-63
Number of pages12
EditionPART 1
ISBN (Print)9783662439470
DOIs
StatePublished - 2014
Externally publishedYes
Event41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 - Copenhagen, Denmark
Duration: 8 Jul 201411 Jul 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume8572 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference41st International Colloquium on Automata, Languages, and Programming, ICALP 2014
Country/TerritoryDenmark
CityCopenhagen
Period8/07/1411/07/14

Fingerprint

Dive into the research topics of 'Distance labels with optimal local stretch'. Together they form a unique fingerprint.

Cite this