Exact and approximate distances in graphs – A survey

Uri Zwick

doi:10.1007/3-540-44676-1_3

Exact and approximate distances in graphs – A survey

Uri Zwick^*

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings
Editors	Friedhelm Meyer auf der Heide
Publisher	Springer Verlag
Pages	33-48
Number of pages	16
ISBN (Print)	9783540424932
DOIs	https://doi.org/10.1007/3-540-44676-1_3
State	Published - 2001
Event	9th Annual European Symposium on Algorithms, ESA 2001 - Arhus, Denmark Duration: 28 Aug 2001 → 31 Aug 2001

Publication series

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

Conference

Conference	9th Annual European Symposium on Algorithms, ESA 2001
Country/Territory	Denmark
City	Arhus
Period	28/08/01 → 31/08/01

Access to Document

10.1007/3-540-44676-1_3

Cite this

Zwick, U. (2001). Exact and approximate distances in graphs – A survey. In F. M. auf der Heide (Ed.), Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings (pp. 33-48). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2161). Springer Verlag. https://doi.org/10.1007/3-540-44676-1_3

@inproceedings{1b9ed2499e3140bf9162cdcb751770d1,

title = "Exact and approximate distances in graphs – A survey",

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.",

author = "Uri Zwick",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; null ; Conference date: 28-08-2001 Through 31-08-2001",

year = "2001",

doi = "10.1007/3-540-44676-1_3",

language = "אנגלית",

isbn = "9783540424932",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "33--48",

editor = "{auf der Heide}, {Friedhelm Meyer}",

booktitle = "Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings",

}

Zwick, U 2001, Exact and approximate distances in graphs – A survey. in FM auf der Heide (ed.), Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2161, Springer Verlag, pp. 33-48, 9th Annual European Symposium on Algorithms, ESA 2001, Arhus, Denmark, 28/08/01. https://doi.org/10.1007/3-540-44676-1_3

Exact and approximate distances in graphs – A survey. / Zwick, Uri.

Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. ed. / Friedhelm Meyer auf der Heide. Springer Verlag, 2001. p. 33-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2161).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Exact and approximate distances in graphs – A survey

AU - Zwick, Uri

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84943271885&partnerID=8YFLogxK

U2 - 10.1007/3-540-44676-1_3

DO - 10.1007/3-540-44676-1_3

M3 - פרסום בספר כנס

AN - SCOPUS:84943271885

SN - 9783540424932

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 33

EP - 48

BT - Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings

A2 - auf der Heide, Friedhelm Meyer

PB - Springer Verlag

Y2 - 28 August 2001 through 31 August 2001

ER -

Exact and approximate distances in graphs – A survey

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this