Approximate distance labeling schemes (Extended abstract)

Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg

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

78 Scopus citations


We consider the problem of labeling the nodes of an n-node graph G with short labels in such a way that the distance between any two nodes u; v of G can be approximated efficiently (in constant time) by merely inspecting the labels of u and v, without using any other information. We develop such constant approximate distance labeling schemes for the classes of trees, bounded treewidth graphs, planar graphs, k-chordal graphs, and graphs with a dominating pair (including for instance interval, permutation, and AT-free graphs). We also establish lower bounds, and prove that most of our schemes are optimal in terms of the length of the labels generated and the quality of the approximation.

Original languageEnglish
Title of host publicationAlgorithms - ESA 2001 - 9th Annual European Symposium, Proceedings
EditorsFriedhelm Meyer auf der Heide
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540424932
StatePublished - 2001
Event9th Annual European Symposium on Algorithms, ESA 2001 - Arhus, Denmark
Duration: 28 Aug 200131 Aug 2001

Publication series

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


Conference9th Annual European Symposium on Algorithms, ESA 2001

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.


  • Approximate distance
  • Distributed data structures
  • Labeling schemes
  • Local representations


Dive into the research topics of 'Approximate distance labeling schemes (Extended abstract)'. Together they form a unique fingerprint.

Cite this