Dual-failure distance and connectivity oracles

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 506-515

  Duan, Ran ^a   Pettie, Seth ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAILURE (MECHANICAL);

COMMUNICATIONS NETWORKS; COORDINATED ATTACK; DISTANCE METRICS; FIXED NUMBERS; LINK FAILURES; POLY-LOGARITHMIC FACTORS; ROUTE QUERIES; SHEER COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 70349148206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.56     Document Type: Conference Paper

References (20)

1. M. A. Bender and M. Farach-Colton. The LCA problem revisited. In Proceedings 4th Latin American Symp. on Theoretical Informatics (LATIN), LNCS Vol. 1776, pages 88-94, 2000.
2. M. A. Bender and M. Farach-Colton. The level ancestor problem simplified. Theoretical Computer Science, 321(1):5-12, 2004.
3. A. Bernstein and D. Karger. Improved distance sensitivity oracles via random sampling. In Proceedings 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 34-43, 2008.
4. T. M. Chan, M. Pǎtraşcu, and L. Roditty. Dynamic connectivity: Connecting to networks and geometry. In Proceedings 49th IEEE Symposium on Foundations of Computer Science (FOCS), 2008.
5. C. Demetrescu and G. F. Italiano. A new approach to dynamic all pairs shortest paths. J. ACM, 51(6):968-992, 2004.
6. C. Demetrescu, M. Thorup, R. A. Chowdhury, and V. Ramachandran. Oracles for distances avoiding a failed node or link. SIAM J. Comput., 37(5):1299-1318, 2008.
7. Y. Emek, D. Peleg, and L. Roditty. A near-linear time algorithm for computing replacement paths in planar directed graphs. In Proceedings 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 428-435, 2008.
8. J. Hershberger and S. Suri. Vickrey prices and shortest paths: what is an edge worth? In Proceedings 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 252-259, 2001. Erratum, Proc. 43rd FOCS, p. 809, 2002.
9. J. Hershberger, S. Suri, and A. Bhosle. On the difficulty of some shortest path problems. In Proceedings 20th Symposium on Theoretical Aspects of Computer Science (STACS), pages 343-354, 2003.
10. D. R. Karger, D. Koller, and S. J. Phillips. Finding the hidden path: Time bounds for all-pairs shortest paths. SIAM J. Comput, 22(6):1199-1217, 1993.
11. E. L. Lawler. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Sci., 18:401-405, 1971/1972.
12. K. Malik, A. K. Mittal, and S. K. Gupta. The k most vital arcs in the shortest path problem. Oper. Res. Lett., 8(4):223-227, 1989.
13. E. Nardelli, G. Proietti, and P. Widmayer. A faster computation of the most vital edge of a shortest path. Info. Proc. Lett., 79(2):81-85, 2001.
14. E. Nardelli, G. Proietti, and P. Widmayer. Finding the most vital node of a shortest path. Theoretical Computer Science, 296(1):167-177, 2003.
15. N. Nisan and A. Ronen. Algorithmic mechanism design. Games Econom. Behav., 35(1-2):166-196, 2001. Economics and artificial intelligence.
16. M. Pǎtraşcu and M. Thorup. Planning for fast connectivity updates. In Proceedings 48th IEEE Symposium on Foundations of Computer Science (FOCS), pages 263-271, 2007.
17. S. Pettie. Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time. In Proceedings 16th Int'l Symposium on Algorithms and Computation (ISAAC), pages 964-973, 2005.
18. L. Roditty and U. Zwick. Replacement paths and k-simple shortest paths in unweighted directed graphs. In Proceedings 32nd Int'l Colloq. on Automata, Languages, and Programming (ICALP), pages 249-260, 2005.
19. B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput., 17(6):1253-1262, 1988.
20. J. Y. Yen. Finding the K shortest loopless paths in a network. Management Sci., 17:712-716, 1970/1971.