Fast and compact oracles for approximate distances in planar graphs

Laurent Flindt Muller; Martin Zachariasen

doi:10.1007/978-3-540-75520-3_58

Fast and compact oracles for approximate distances in planar graphs

Laurent Flindt Muller, Martin Zachariasen

Department of Computer Science

7 Citations (Scopus)

Original language	English
Title of host publication	Algorithms - ESA 2007 : 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings
Editors	Lars Arge, Michael Hoffmann, Emo Welzl
Place of Publication	Berlin/Heidelberg
Publisher	Springer
Publication date	2007
Pages	657–668
ISBN (Print)	9783540755197
DOIs	https://doi.org/10.1007/978-3-540-75520-3_58
Publication status	Published - 2007

Series	Lecture notes in computer science
Number	4698
ISSN	0302-9743

Keywords

Faculty of Science
shortest paths
data structures

Access to Document

10.1007/978-3-540-75520-3_58

Cite this

Muller, L. F., & Zachariasen, M. (2007). Fast and compact oracles for approximate distances in planar graphs. In L. Arge, M. Hoffmann, & E. Welzl (Eds.), Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings (pp. 657–668). Springer. Lecture notes in computer science No. 4698 https://doi.org/10.1007/978-3-540-75520-3_58

Fast and compact oracles for approximate distances in planar graphs. / Muller, Laurent Flindt; Zachariasen, Martin.

Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings. ed. / Lars Arge; Michael Hoffmann; Emo Welzl. Berlin/Heidelberg : Springer, 2007. p. 657–668 (Lecture notes in computer science; No. 4698).

Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research

Muller, LF & Zachariasen, M 2007, Fast and compact oracles for approximate distances in planar graphs. in L Arge, M Hoffmann & E Welzl (eds), Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings. Springer, Berlin/Heidelberg, Lecture notes in computer science, no. 4698, pp. 657–668. https://doi.org/10.1007/978-3-540-75520-3_58

Muller LF, Zachariasen M. Fast and compact oracles for approximate distances in planar graphs. In Arge L, Hoffmann M, Welzl E, editors, Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings. Berlin/Heidelberg: Springer. 2007. p. 657–668. (Lecture notes in computer science; No. 4698). doi: 10.1007/978-3-540-75520-3_58

Muller, Laurent Flindt ; Zachariasen, Martin. / Fast and compact oracles for approximate distances in planar graphs. Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings. editor / Lars Arge ; Michael Hoffmann ; Emo Welzl. Berlin/Heidelberg : Springer, 2007. pp. 657–668 (Lecture notes in computer science; No. 4698).

@inbook{47732000f26811dcbee902004c4f4f50,

title = "Fast and compact oracles for approximate distances in planar graphs",

keywords = "Faculty of Science, korteste veje, datastrukturer, shortest paths, data structures",

author = "Muller, {Laurent Flindt} and Martin Zachariasen",

year = "2007",

doi = "10.1007/978-3-540-75520-3_58",

language = "English",

isbn = "9783540755197",

series = "Lecture notes in computer science",

publisher = "Springer",

number = "4698",

pages = "657–668",

editor = "Lars Arge and Michael Hoffmann and Emo Welzl",

booktitle = "Algorithms - ESA 2007",

}

TY - CHAP

T1 - Fast and compact oracles for approximate distances in planar graphs

AU - Muller, Laurent Flindt

AU - Zachariasen, Martin

PY - 2007

Y1 - 2007

KW - Faculty of Science

KW - korteste veje

KW - datastrukturer

KW - shortest paths

KW - data structures

U2 - 10.1007/978-3-540-75520-3_58

DO - 10.1007/978-3-540-75520-3_58

M3 - Book chapter

SN - 9783540755197

T3 - Lecture notes in computer science

SP - 657

EP - 668

BT - Algorithms - ESA 2007

A2 - Arge, Lars

A2 - Hoffmann, Michael

A2 - Welzl, Emo

PB - Springer

CY - Berlin/Heidelberg

ER -