Improved Distance Oracles for Avoiding Link-Failure

Authors:
Rezaul Alam Chowdhury;Vijaya Ramachandran
Affiliations:
-;-
Venue:
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Year:
2002

Citing 9
Cited 2

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Fast parallel algorithms for chordal graphs

SIAM Journal on Computing
Parallel algorithms for reducible flow graphs

Journal of Algorithms
A fully dynamic algorithm for maintaining the transitive closure

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Computing shortest paths with comparisons and additions

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Oracles for distances avoiding a link-failure

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science

A nearly optimal oracle for avoiding failed vertices and edges

Proceedings of the forty-first annual ACM symposium on Theory of computing
Finding Alternative Shortest Paths in Spatial Networks

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of preprocessing an edge-weighted directed graph to answer queries that ask for the shortest path from any given vertex to another avoiding a failed link. We present two algorithms that improve on earlier results for this problem. Our first algorithm, which is a modification of an earlier method, improves the query time to a constant while maintaining the earlier bounds for preprocessing time andspace. Our second result is a new algorithm whose preprocessing time is considerably faster than earlier results and whose query time and space are worse by no more than a logarithmic factor.