Author:
Baswana Surender,Goyal Vishrut,Sen Sandeep
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in Õ(n2) time. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 271–280 (2004)
2. Cohen, E., Zwick, U.: All-pairs small stretch paths. Journal of Algorithms 38, 335–353 (2001)
3. Dor, D., Halperin, S., Zwick, U.: All pairs almost shortest paths. Siam Journal on Computing 29, 1740–1759 (2000)
4. Elkin, M.: Computing almost shortest paths. In: Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 53–62 (2001)
5. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with o(1) worst case time. Journal of ACM 31, 538–544 (1984)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Study on the Effect of 2-Approximate Shortest-Path Integration in Extracting Context-Sensitive Dense Structures;Proceedings of the 15th Annual Meeting of the Forum for Information Retrieval Evaluation;2023-12-15
2. Fast Approximate Shortest Paths in the Congested Clique;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16
3. Approximating the Girth;ACM Transactions on Algorithms;2013-03
4. Approximating Shortest Paths in Graphs;WALCOM: Algorithms and Computation;2009
5. Local Computation of Nearly Additive Spanners;Lecture Notes in Computer Science;2009