Author:
Gudmundsson Joachim,Narasimhan Giri,Smid Michiel
Reference17 articles.
1. Agarwal PK, Har-Peled S, Karia M (2000) Computing approximate shortest paths on convex polytopes. In: Proceedings of the 16th ACM symposium on computational geometry, Hong Kong, pp 270–279
2. Arikati S, Chen DZ, Chew LP, Das G, Smid M, Zaroliagis CD (1996) Planar spanners and approximate shortest path queries among obstacles in the plane. In: Proceedings of the 4th annual european symposium on algorithms, Barcelona. Lecture notes in computer science, vol 1136. Springer, Berlin, pp 514–528
3. Baswana S, Sen S (2004) Approximate distance oracles for unweighted graphs in
Õ
(
n
2
)
$$\tilde{O}(n^{2})$$
time. In: Proceedings of the 15th ACM-SIAM symposium on discrete algorithms, Philadelphia, pp 271–280
4. Bender MA, Farach-Colton M (2000) The LCA problem revisited. In: Proceedings of the 4th Latin American symposium on theoretical informatics, Punta del Este. Lecture notes in computer science, vol 1776. Springer, Berlin, pp 88–94
5. Chen DZ, Daescu O, Klenk KS (2001) On geometric path query problems. Int J Comput Geom Appl 11:617–645