Oracles for distances avoiding a failed node or link

SIAM Journal on Computing

Volumn 37, Issue 5, 2007, Pages 1299-1318

  Demetrescu, Camil ^a   Thorup, Mikkel ^b   Chowdhury, Rezaul Alam ^c   Ramachandran, Vijaya ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b AT AND T LABS RESEARCH   (United States)

^c University of Texas at Austin   (United States)

Author keywords

Data structures; Graph algorithms; Shortest paths, Network failures

Indexed keywords

CONSTRUCTION TIMES; FAILED NODES; GRAPH ALGORITHMS; LINK FAILURES; PRE-PROCESSING; PREPROCESSING TIMES; PROBLEM MODELS; QUERY TIMES; SHORTEST PATHS; SHORTEST PATHS, NETWORK FAILURES; WEIGHTED DIRECTED GRAPHS;

DATA STRUCTURES; FILE ORGANIZATION; GRAPH THEORY; MANGANESE ALLOYS; MANGANESE COMPOUNDS; WIRELESS SENSOR NETWORKS;

COMPUTER NETWORKS;

EID: 55249115130     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705429847     Document Type: Article

References (27)

1. M. O. BALL, B. L. GOLDEN, AND R. V. VOHRA, Finding the most vital arcs in a network Oper. Res. Lett., 8 (1989), pp. 73-76.
2. A. BAR-NOY, S. KHULLER, AND B. SCHIEBER, The Complexity of Finding Most Vital Arcs and Nodes. Technical report CS-TR-3539, Institute for Advanced Studies, University of Maryland, College Park, MD, 1995.
3. R. A. CHOWDHURY AND V. RAMACHANDRAN, Improved distance oracles for avoiding a link-failure, in Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC'02), Vancouver, Canada, Lecture Notes in Comput. Sci, 2518, Springer-Verlag, New York, 2002, pp. 523-534.
4. H. W. CORLEY AND D. Y. SHA, Most vital links and nodes in weighted networks, Oper. Res. Lett., 8 (1982), pp. 157-160.
5. C. DEMETRESCU AND G. F. ITALIANO, Fully dynamic all pairs shortest paths with real edge weights, in Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS'01), Las Vegas, NV, 2001, pp. 260-267.
6. C. DEMETRESCU AND G. F. ITLALIANO, A new approach to dynamic all pairs shortest paths, J. ACM, 51 (2004), pp. 968-992.
7. C. DEMETRESCU AND M. THORUP, Oracles for distances avoiding a link-failure, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02) (San Francisco, CA), SIAM, Philadelphia, ACM, New York, 2002, pp. 838-843.
8. F. W. DIJKSTRA, A note on two problems in connection with graphs, Nurner. Math., 1 (1959), pp. 269-271.
9. B. FORTZ AND M. THORUP, Internet traffic engineering by optimizing OSPF weights, in Proceedings of the 19th IEEE INFOCOM, The Conference on Computer Communications, Tel-Aviv, Israel, 2000, pp. 519-528.
10. M. L. FREDMAN AND R. F. TARJAN, Fibonacci heaps and their use in improved network optimization algorithms, J. ACM, 34 (1987), pp. 596-615.
11. J. HERSHBERGER AND S. SURI, Vickrey prices and shortest paths: What is an edge worth?, in Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS'01), Las Vegas, NV, 2001, pp. 252-259. Erratum in FOCS'02.
12. J. HERSHBERGER, S. SURI, AND A. BHOSLE, On the difficulty of some shortest path problems, in Proceedings of the 20th International Symposium of Theoretical Aspects of Computer Science (STACS'03), Berlin, Germany, 2003, pp. 343-354.
13. V. KING, Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS'99), New York, 1999, pp. 81-99.
14. V. KING AND G. SAGERT, A fully dynamic algorithm for maintaining the transitive closure, J. Comput. System Sci., 65 (2002), pp. 150-167.
15. 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'01), Guilin, China, Lecture Notes in Comput. Sci. 2108, Springer-Verlag, New York, 2001, pp. 268-277.
16. J. MOY, OSPF: Anatomy of an Internet Routing Protocol, Addison-Wesley, Reading, MA, 1999.
17. A. MAS-COLLEL, W. WHINSTON, AND J. GREEN, Microeconomic Theory, Oxford University Press, Oxford, UK, 1999.
18. F. NARDELLI, G. PROIETTI, AND P. WIDMAYER, Finding the most vital node of a shortest path, in Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON'01), Guilin, China, Lecture Notes in Comput. Sci. 2108, Springer-Verlag, New York, 2001, pp. 278-287.
19. N. NISAN AND A. RONEN, Algorithmic mechanism design, in Proceedings of the 31st Annual ACM Symposium on Theory of Computation (STOC'99), ACM, New York, 1999, pp. 129-140.
20. S. PETTIE, A new approach to all-pairs shortest paths on real-weighted graphs, Theoret. Comput. Sci., 312 (2003), pp. 47-74.
21. L. RODITTY AND U. ZWICK, Replacement paths and k simple shortest paths in unweighted directed graphs, in Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP'05), Lisboa, Portugal, Lecture Notes in Comput. Sci. 3580, Springer-Vcrlag, New York, 2005, pp. 249-260.
22. T. TAKAOKA, Subcubic cost algorithms for the all pairs shortest path problem, Algorithmica, 30 (1998), pp. 309-318.
23. M. THORUP, Undirected single source shortest paths with positive integer weights in linear time, J. ACM, 46 (1999), pp. 362-394.
24. M. THORUP, Fortifying OSPF/IS-IS Against Link-Failure, manuscript, 2001.
25. M. THORUP, Fully dynamic all-pairs shortest paths: Faster and allowing negative cycles, in Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT'04), Hnmlebaek, Denmark, 2004, pp. 384-396.
26. M. THORUP, Integer priority queues with decrease key in constant time and the single source shortest paths problem, J. Comput. System Sci., 69 (2004), pp. 330-353.
27. U. ZWICK, A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths, in Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC'04), Hong Kong, China, Lecture Notes in Comput. Sci. 3341, Springer-Verlag, 2004, pp. 921-932.