Surender Baswana, Vishrut Goyal, Sandeep Sen. All-Pairs Nearly 2-Approximate Shortest-Paths in O(n:::2::: polylog n) Time. In Volker Diekert, Bruno Durand, editors, STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings. Volume 3404 of Lecture Notes in Computer Science, pages 666-679, Springer, 2005. [doi]
@inproceedings{BaswanaGS05,
title = {All-Pairs Nearly 2-Approximate Shortest-Paths in O(n:::2::: polylog n) Time},
author = {Surender Baswana and Vishrut Goyal and Sandeep Sen},
year = {2005},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3404&spage=666},
researchr = {https://researchr.org/publication/BaswanaGS05},
cites = {0},
citedby = {0},
pages = {666-679},
booktitle = {STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
editor = {Volker Diekert and Bruno Durand},
volume = {3404},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-24998-2},
}