Funder
Israel Science Foundation
United States - Israel Binational Science Foundation
I-CORE
Ministry of Science and Technology, Israel
Citi Foundation
Google European Fellowship
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28(4), 1167–1181 (1999)
2. Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in expected $$O(n^2)$$ time. ACM Trans. Algorithms 2(4), 557–577 (2006)
3. Baswana, S., Khanna, N.: Approximate shortest paths avoiding a failed vertex: optimal size data structures for unweighted graph. In: Proceedings of the 27th Symposium on Theoretical Aspects of Computer Science, pp. 513–524 (2010)
4. Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: Additive spanners and $$(\alpha, \beta )$$-spanners. ACM Trans. Algorithms 7, A5 (2010)
5. Bernstein, A.: A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs. In: Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (2010)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Blackout-tolerant temporal spanners;Journal of Computer and System Sciences;2024-05