Approximate Distance Sensitivity Oracles in Subquadratic Space-Reference-Cited by-同舟云学术

Approximate Distance Sensitivity Oracles in Subquadratic Space

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bilò Davide¹,Chechik Shiri²,Choudhary Keerti³,Cohen Sarel⁴,Friedrich Tobias⁵,Krogmann Simon⁵,Schirneck Martin⁶

Affiliation:

1. University of L’Aquila, Italy

2. Tel Aviv University, Israel

3. IIT Delhi, India

4. Academic College of Tel Aviv-Yaffo, Israel

5. Hasso Plattner Institute, Potsdam, Germany

6. University of Vienna, Austria

Funder

European Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3564246.3585251

Reference30 articles.

1. Restoration by path concatenation: fast recovery of MPLS paths

2. Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs

3. The LCA Problem Revisited

4. Aaron Bernstein and David R. Karger . 2008. Improved Distance Sensitivity Oracles via Random Sampling . In Proceedings of the 19th Symposium on Discrete Algorithms (SODA). 34–43 . https://dl.acm.org/doi/abs/10.5555/1347082.1347087 Aaron Bernstein and David R. Karger. 2008. Improved Distance Sensitivity Oracles via Random Sampling. In Proceedings of the 19th Symposium on Discrete Algorithms (SODA). 34–43. https://dl.acm.org/doi/abs/10.5555/1347082.1347087

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compact Distance Oracles with Large Sensitivity and Low Stretch;Lecture Notes in Computer Science;2023