Space-efficient path-reporting approximate distance oracles

Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirements, for general undirected graphs. For distance oracles, we show how to break the nlog⁡n space bound of Thorup and Zwick if approximate paths rather than distances need to be reported. For approximate distance labeling and labeled routing, we break the previously best known space bound of O(log⁡n) words per vertex. The cost for such space efficiency is an increased stretch.

Original languageEnglish
Pages (from-to)1-10
Number of pages10
JournalTheoretical Computer Science
StatePublished - 25 Oct 2016


  • Distance oracles
  • Labeling scheme
  • Routing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Space-efficient path-reporting approximate distance oracles'. Together they form a unique fingerprint.

Cite this