Approximate distance oracles with improved query time

Christian Wulff-Nilsen

doi:10.1137/1.9781611973105.39

Approximate distance oracles with improved query time

Christian Wulff-Nilsen

Department of Computer Science

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

37 Citations (Scopus)

Original language	English
Title of host publication	Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
Editors	Sanjeev Khanna
Number of pages	11
Publisher	Association for Computing Machinery
Publication date	2013
Pages	539-549
ISBN (Print)	978-1-61197-251-1
ISBN (Electronic)	978-1-61197-310-5
DOIs	https://doi.org/10.1137/1.9781611973105.39
Publication status	Published - 2013
Event	Annual ACM-SIAM Symposium on Discrete Algorithms 2013 - New Orleans, United States Duration: 6 Jan 2013 → 8 Jan 2013 Conference number: 24

Conference

Conference	Annual ACM-SIAM Symposium on Discrete Algorithms 2013
Number	24
Country/Territory	United States
City	New Orleans
Period	06/01/2013 → 08/01/2013

Series	The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings
ISSN	1071-9040

Access to Document

10.1137/1.9781611973105.39

Cite this

Approximate distance oracles with improved query time. / Wulff-Nilsen, Christian.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Sanjeev Khanna. Association for Computing Machinery, 2013. p. 539-549 (The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings).

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

Wulff-Nilsen, C 2013, Approximate distance oracles with improved query time. in S Khanna (ed.), Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, pp. 539-549, Annual ACM-SIAM Symposium on Discrete Algorithms 2013, New Orleans, United States, 06/01/2013. https://doi.org/10.1137/1.9781611973105.39

@inproceedings{990e3db9f82d478db283c9e8d4f33b65,

title = "Approximate distance oracles with improved query time",

author = "Christian Wulff-Nilsen",

year = "2013",

doi = "10.1137/1.9781611973105.39",

language = "English",

isbn = "978-1-61197-251-1",

series = "The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings",

publisher = "Association for Computing Machinery",

pages = "539--549",

editor = "Sanjeev Khanna",

booktitle = "Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms",

note = "null ; Conference date: 06-01-2013 Through 08-01-2013",

}

TY - GEN

T1 - Approximate distance oracles with improved query time

AU - Wulff-Nilsen, Christian

N1 - Conference code: 24

PY - 2013

Y1 - 2013

U2 - 10.1137/1.9781611973105.39

DO - 10.1137/1.9781611973105.39

M3 - Article in proceedings

SN - 978-1-61197-251-1

T3 - The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings

SP - 539

EP - 549

BT - Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms

A2 - Khanna, Sanjeev

PB - Association for Computing Machinery

Y2 - 6 January 2013 through 8 January 2013

ER -