Exact and approximate distances in graphs – A survey

Uri Zwick*

*Corresponding author for this work

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

Abstract

We survey recent and not so recent results related to the computation of exact and approximate distances, and corresponding shortest, or almost shortest, paths in graphs. We consider many different settings and models and try to identify some remaining open problems.

Original languageEnglish
Title of host publicationAlgorithms - ESA 2001 - 9th Annual European Symposium, Proceedings
EditorsFriedhelm Meyer auf der Heide
PublisherSpringer Verlag
Pages33-48
Number of pages16
ISBN (Print)9783540424932
DOIs
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)
Volume2161
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th Annual European Symposium on Algorithms, ESA 2001
Country/TerritoryDenmark
CityArhus
Period28/08/0131/08/01

Fingerprint

Dive into the research topics of 'Exact and approximate distances in graphs – A survey'. Together they form a unique fingerprint.

Cite this