Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Finding the hidden path: time bounds for all-pairs shortest paths
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The complexity of finding most vital arcs and nodes
The complexity of finding most vital arcs and nodes
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?"
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
An Optimal Minimum Spanning Tree Algorithm
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Difficulty of Some Shortest Path Problems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Undirected single source shortest paths in linear time
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Vickrey Prices and Shortest Paths: What is an Edge Worth?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
The k most vital arcs in the shortest path problem
Operations Research Letters
Finding the anti-block vital edge of a shortest path between two nodes
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Real time critical edge of the shortest path in transportation networks
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We present near-optimal algorithms for two problems related to finding the replacement paths for edges with respect to shortest paths in sparse graphs. The problems essentially study how the shortest paths change as edges on the path fail, one at a time. Our technique improves the existing bounds for these problems on directed acyclic graphs, planar graphs, and non-planar integer-edge-weighted graphs.