Aaron Bernstein
David Karger
ABSTRACT
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V,E) with non-negative edge weights to answer queries of the form: what is the length of the shortest path from x to y that does not go through some failed vertex or edge f. The previous best algorithm produces an oracle of size ~O(n2) that has an O(1) query time, and an ~O(n2√m) construction time. It was a randomized Monte Carlo algorithm that worked with high probability. Our oracle also has a constant query time and an ~O(n2) space requirement, but it has an improved construction time of ~O(mn), and it is deterministic. Note that O(1) query, O(n2) space, and O(mn) construction time is also the best known bound (up to logarithmic factors) for the simpler problem of finding all pairs shortest paths in a weighted, directed graph. Thus, barring improved solutions to the all pairs shortest path problem, our oracle is optimal up to logarithmic factors.
- .O. Ball, B.L. Golden, and R.V. Vohra. Finding the most vital arcs in a network. Operations Research Letters, 8:73--76, 1989.Google Scholar
Digital Library
- . Bar--Noy, S. Khuller, and B. Schieber. The complexity of finding most vital arcs and nodes. Technical Report No CS-TR-3539, Institute for Advanced Studies, University of Maryland, College Park, MD, 1995.Google Scholar
- .Berkman and U.Vishkin. Recursive star-tree parallel data structure. SIAM Journal of Computing, 22(2):221--242, 1993. Google ScholarDigital Library
- . Bernstein and D. Karger. Improved distance sensitivity oracles via random sampling. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08), San Francisco, California, pages 34--43, 2008. Google ScholarDigital Library
- .A. Chowdhury and V. Ramach. Improved distance oracles for avoiding link-failure. In Proc. of the 13th International Symposium on Algorithms and Computation (ISAAC '02), Vancouver, Canada, LNCS 2518, pages 523--534, 2002. Google ScholarDigital Library
- . Demetrescu, M. Thorup, R.A. Chowdhury, and V. Ramachandran. Oracles for distances avoiding a node or link failure. SIAM Journal of computing, 37(5):1299--1318, 2008. Google ScholarDigital Library
- .Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269--271, 1959.Google ScholarDigital Library
- . Emek, D. Peleg, and L. Roditty. A near-linear time algorithm for computing replacement paths in planar directed graphs. In Proc. of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08), San Francisco, California, pages 428--435, 2008. Google ScholarDigital Library
- .Harel and R.E.Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing, 13(2):338--355, 1984. Google ScholarDigital Library
- .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, Nevada, pages 129--140, 2001. Erratum in FOCS '02. Google ScholarDigital Library
- . Hershberger, S. Suri, and A. Bhosle. On the difficulty of some shortest path problems. In Proc. of the 20th International Symposium of Theoretical Aspects of Computer Science (STACS'03), Berlin, Germany, pages 343--354, 2003. Google ScholarDigital Library
- . King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science (FOCS '99), New York, NY, pages 81--89, 1999. Google ScholarDigital Library
- . Roditty and U. Zwick. Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming, Lisboa, Portugal, pages 249--260, 2005. Google ScholarDigital Library
Index Terms
- A nearly optimal oracle for avoiding failed vertices and edges
Recommendations
Oracles for Distances Avoiding a Failed Node or Link
We consider the problem of preprocessing an edge-weighted directed graph $G$ to answer queries that ask for the length and first hop of a shortest path from any given vertex $x$ to any given vertex $y$ avoiding any given vertex or edge. As a natural ...
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
We give the first linear-time algorithm for computing single-source shortest paths in a weighted interval or circular-arc graph, when we are given the model of that graph, i.e., the actual weighted intervals or circular-arcsand the sorted list of the ...
(Nearly) sample-optimal sparse Fourier transform
SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithmsWe consider the problem of computing a k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. Our main result is a randomized algorithm that computes such an approximation using O(k log n(log log n)O(1)) signal samples in ...
Comments