A near-linear-time algorithm for computing replacement paths in planar directed graphs

Yuval Emek, Liam Roditty, David Peleg

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

Let G = (V(G), E(G)) be a directed graph with nonnegative edge lengths and let P be a shortest path from s to t in G .Inthe replacement paths problem we are required to compute for every edge e in P, the length of a shortest path from s to t that avoids e. The fastest known algorithm for solving the problem in weighted directed graphs is the trivial one: each edge in P is removed from the graph in its turn and the distance from s to t in the modified graph is computed. The running time of this algorithm is O (mn + n2 log n), where n = | V(G)| and m = | E(G)|. The replacement paths problemis strongly motivated by two different applications. First, the fastest algorithm to compute the k simple shortest paths from s to t in directed graphs [Yen 1971; Lawler 1972] repeatedly computes the replacement paths from s to t . Its running time is O(kn(m +n log n)). Second, the computation of Vickrey pricing of edges in distributed networks can be reduced to the replacement paths problem. An open question raised by Nisan and Ronen [2001] asks whether it is possible to compute the Vickrey pricing faster than the trivial algorithm described in the previous paragraph. In this article we present a near-linear time algorithm for computing replacement paths in weighted planar directed graphs. In particular, the algorithm computes the lengths of the re-placement paths in O(n log3 n) time (recall that in planar graphs m = O(n)). This result immediately improves the running time of the two applications mentioned before by almost a linear factor. Our algorithm is obtained by combining several new ideas with a data structure of Klein [2005] that supports multisource shortest paths queries in planar directed graphs in logarithmic time. Our algorithm can be adapted to address the variant of the problem in which one is interested in the replacement path itself (rather than the length of the path). In that case the algorithm is executed in a preprocessing stage constructing a data structure that supports replacement path queries in time Õ(h), where h is the number of hops in the replacement path. In addition, we can handle the variant in which vertices should be avoided instead of edges.

Original languageEnglish
Article number64
JournalACM Transactions on Algorithms
Volume6
Issue number4
DOIs
StatePublished - Aug 2010

Keywords

  • Planar graphs
  • Replacement paths

Fingerprint

Dive into the research topics of 'A near-linear-time algorithm for computing replacement paths in planar directed graphs'. Together they form a unique fingerprint.

Cite this