Author:
Bose Prosenjit,Morin Pat,van Renssen André,Verdonschot Sander
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)
2. Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 56–65 (1987)
3. Lecture Notes in Computer Science;J. Keil,1988
4. Ruppert, J., Seidel, R.: Approximating the d-dimensional complete Euclidean graph. In: Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG 1991), pp. 207–210 (1991)
5. Lecture Notes in Computer Science;N. Bonichon,2010
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Price of Order;Algorithms and Computation;2014
2. On the Stretch Factor of the Theta-4 Graph;Lecture Notes in Computer Science;2013