Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack. An Improved Approximation Algorithm for Computing Geometric Shortest Paths. In Andrzej Lingas, Bengt J. Nilsson, editors, Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings. Volume 2751 of Lecture Notes in Computer Science, pages 246-257, Springer, 2003. [doi]
@inproceedings{AleksandrovMS03,
title = {An Improved Approximation Algorithm for Computing Geometric Shortest Paths},
author = {Lyudmil Aleksandrov and Anil Maheshwari and Jörg-Rüdiger Sack},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2751&spage=246},
researchr = {https://researchr.org/publication/AleksandrovMS03},
cites = {0},
citedby = {0},
pages = {246-257},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings},
editor = {Andrzej Lingas and Bengt J. Nilsson},
volume = {2751},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-40543-7},
}