1. Greedy partitioned algorithms for the shortest-path problem;Adamson;International Journal of Parallel Programming,1991
2. P. Adamson, E. Tick, Parallel algorithms for the single-source shortest-path problem, in: International Conference on Parallel Processing, 1992, pp. III-346–350
3. Approximating shortest paths on a convex polytope in three dimensions;Agarwal;Journal of the ACM,1997
4. P.K. Agarwal, K.R. Varadarajan, Approximating shortest paths on a nonconvex polyhedron, in: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, 1997
5. L. Aleksandrov, M. Lanthier, A. Maheshwari, J.-R. Sack, An ϵ-approximation algorithm for weighted shortest path queries on polyhedral surfaces, in: 14th European Workshop on Computational Geometry, Barcelona, Spain, 1998, pp. 19–21