Oracles for distances avoiding a link-failure

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 838-843

  Demetrescu, Camil ^a   Thorup, Mikkel ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

FAILED LINKS; LINK FAILURES; NONTRIVIAL SOLUTION; QUERY TIME; SHORTEST PATH;

GRAPH THEORY;

EID: 84968764404     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. C. Demetrescu and G.F. Italiano. Fully dynamic all pairs shortest paths with real edge weights. In Proc. of the 42nd IEEE Annual Symposium on Foundations of Computer Science, (FOCS'01), Las Vegas, Nevada, 2001.
2. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings of the 19th IEEE INFOCOM -The Conference on Computer Communications, pages 519-528, 2000.
3. M.L. Fredman and R.E. Tarjan. Fibonacci heaps and their use in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
4. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS'99), pages 81-99, 1999.
5. V. King and G. Sagert. A fully dynamic algorithm for maintaining the transitive closure. In Proc. 31st ACM Symposium on Theory of Computing (STOC'99), pages 492-498, 1999.
6. V. King and M. Thorup. A space saving trick for directed dynamic transitive closure and shortest path algorithms. In Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON), LNCS 2108, pages 268-277, 2001.
7. M. Thorup. Fortifying OSPF/IS-IS against link-failure, 2001. Manuscript.
8. U. Zwick. All pairs shortest paths in weighted directed graphs -exact and almost exact algorithms. In Proc. of the 39th IEEE Annual Symposium on Foundations of Computer Science (FOCS'98), pages 310-319, Los Alamitos, CA, November 8-11 1998.