A nearly optimal oracle for avoiding failed vertices and edges

@inproceedings{Bernstein2009ANO,
  title={A nearly optimal oracle for avoiding failed vertices and edges},
  author={Aaron Bernstein and David R. Karger},
  booktitle={STOC},
  year={2009}
}
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… CONTINUE READING
Highly Cited
This paper has 80 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

81 Citations

01020'11'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…