Approximate distance oracles with improved query time
Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review
Standard
Approximate distance oracles with improved query time. / Wulff-Nilsen, Christian.
Encyclopedia of Algorithms. ed. / Ming-Yang Kao. Springer, 2014. p. 1-4.Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review
Harvard
Wulff-Nilsen, C 2014, Approximate distance oracles with improved query time. in M-Y Kao (ed.), Encyclopedia of Algorithms. Springer, pp. 1-4. https://doi.org/10.1007/978-3-642-27848-8_568-1
APA
Wulff-Nilsen, C. (2014). Approximate distance oracles with improved query time. In M-Y. Kao (Ed.), Encyclopedia of Algorithms (pp. 1-4). Springer. https://doi.org/10.1007/978-3-642-27848-8_568-1
Vancouver
Wulff-Nilsen C. Approximate distance oracles with improved query time. In Kao M-Y, editor, Encyclopedia of Algorithms. Springer. 2014. p. 1-4 https://doi.org/10.1007/978-3-642-27848-8_568-1
Author
Bibtex
@inbook{e7e7fd8dca294393b3539d49e3942cb5,
title = "Approximate distance oracles with improved query time",
author = "Christian Wulff-Nilsen",
year = "2014",
doi = "10.1007/978-3-642-27848-8_568-1",
language = "English",
pages = "1--4",
editor = "Ming-Yang Kao",
booktitle = "Encyclopedia of Algorithms",
publisher = "Springer",
address = "Switzerland",
}
RIS
TY - ENCYC
T1 - Approximate distance oracles with improved query time
AU - Wulff-Nilsen, Christian
PY - 2014
Y1 - 2014
U2 - 10.1007/978-3-642-27848-8_568-1
DO - 10.1007/978-3-642-27848-8_568-1
M3 - Encyclopedia chapter
SP - 1
EP - 4
BT - Encyclopedia of Algorithms
A2 - Kao, Ming-Yang
PB - Springer
ER -
ID: 154524336