Abstract
This paper proposes the optimal rescue path set problem in an undirected graph G = (V,E), in which some vehicles have to go from a source node s to a destination node t. However, during the traveling of the vehicles, there might exist one edge blocked in the graph. The goal is to find a minimum collection of paths for the vehicles, to guarantee the fastest arrival of at least one vehicle no matter which edge is blocked. We present an algorithm for the above optimal rescue path set problem, and prove that the complexity of our algorithm is O(m + n logn).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Yen, J.Y.: Finding the K shortest loopless paths in a network. Management Science 17, 712–716 (1971)
Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing 28(2), 652–673 (1998)
Katoh, N., Ibaraki, T., Mine, H.: An efficient algorithm for K shortest simple paths. Networks 12(4), 411–427 (1982)
Akgun, V., Erkut, E., Batta, R.: On finding dissimilar paths. European Journal Of Operational Research 121(2), 232–246 (2000)
Adhari, H., Dreibholz, T., Becke, M.: Evaluation of concurrent multipath transfer over dissimilar paths. In: Proceedings of the 25th IEEE International Conference on Advanced Information Networking and Applications Workshops (WAINA), pp. 708–714 (2011)
Dell’Olmo, P., Gentili, M., Scozzari, A.: On finding dissimilar pareto-optimal paths. European Journal Of Operational Research 162(1), 70–82 (2007)
Malik, K., Mittal, A.K., Gupta, S.K.: The k most vital arcs in the shortest path problem. Operations Research Letters 8(4), 223–227 (1989)
Nardelli, E., Proiett, G., Widmayer, P.: A faster computation of the most vital edge of a shortest path. Information Processing Letter 79(2), 81–85 (2001)
Emek, Y., Peleg, D., Rodity, L.: A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Transactions on Algorithms 6(4), Article 64 (2010)
Wulff-Nilsen, C.: Solving the replacement paths problem for planar directed graphs in O(n logn) time. In: Proceedings of the 21th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 756–765 (2010)
Nardelli, E., Proietti, G., Widmayer, P.: Finding the detour-critical edge of a shortest path between two nodes. Information Processing Letters 67(1), 51–54 (1998)
Xiao, P., Xu, Y., Su, B.: Finding an anti-risk path between two nodes in undirected graphs. Journal of Combinatorial Optimization 17(3), 235–246 (2009)
Hershberger, J., Suri, S.: Vickrey prices and shortest paths: What is an edge worth? In: Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS 2001), pp. 252–259 (2001)
Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34(3), 596–615 (1987)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., Xu, Y. (2013). The Optimal Rescue Path Set Problem in Undirected Graphs. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-38756-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38755-5
Online ISBN: 978-3-642-38756-2
eBook Packages: Computer ScienceComputer Science (R0)