{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:09Z","timestamp":1725583989185},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_14","type":"book-chapter","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T20:43:48Z","timestamp":1369082628000},"page":"118-129","source":"Crossref","is-referenced-by-count":0,"title":["The Optimal Rescue Path Set Problem in Undirected Graphs"],"prefix":"10.1007","author":[{"given":"Huili","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J.Y. Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the K shortest loopless paths in a network. Management Science\u00a017, 712\u2013716 (1971)","journal-title":"Management Science"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing\u00a028(2), 652\u2013673 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"N. Katoh","year":"1982","unstructured":"Katoh, N., Ibaraki, T., Mine, H.: An efficient algorithm for K shortest simple paths. Networks\u00a012(4), 411\u2013427 (1982)","journal-title":"Networks"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S0377-2217(99)00214-3","volume":"121","author":"V. Akgun","year":"2000","unstructured":"Akgun, V., Erkut, E., Batta, R.: On finding dissimilar paths. European Journal Of Operational Research\u00a0121(2), 232\u2013246 (2000)","journal-title":"European Journal Of Operational Research"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013714 (2011)","DOI":"10.1109\/WAINA.2011.92"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2003.10.033","volume":"162","author":"P. Dell\u2019Olmo","year":"2007","unstructured":"Dell\u2019Olmo, P., Gentili, M., Scozzari, A.: On finding dissimilar pareto-optimal paths. European Journal Of Operational Research\u00a0162(1), 70\u201382 (2007)","journal-title":"European Journal Of Operational Research"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K. Malik","year":"1989","unstructured":"Malik, K., Mittal, A.K., Gupta, S.K.: The k most vital arcs in the shortest path problem. Operations Research Letters\u00a08(4), 223\u2013227 (1989)","journal-title":"Operations Research Letters"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(00)00175-7","volume":"79","author":"E. Nardelli","year":"2001","unstructured":"Nardelli, E., Proiett, G., Widmayer, P.: A faster computation of the most vital edge of a shortest path. Information Processing Letter\u00a079(2), 81\u201385 (2001)","journal-title":"Information Processing Letter"},{"issue":"4","key":"14_CR9","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/1824777.1824784","volume":"6","author":"Y. Emek","year":"2010","unstructured":"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)","journal-title":"ACM Transactions on Algorithms"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013765 (2010)","DOI":"10.1137\/1.9781611973075.62"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(98)00077-5","volume":"67","author":"E. Nardelli","year":"1998","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Finding the detour-critical edge of a shortest path between two nodes. Information Processing Letters\u00a067(1), 51\u201354 (1998)","journal-title":"Information Processing Letters"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10878-007-9110-4","volume":"17","author":"P. Xiao","year":"2009","unstructured":"Xiao, P., Xu, Y., Su, B.: Finding an anti-risk path between two nodes in undirected graphs. Journal of Combinatorial Optimization\u00a017(3), 235\u2013246 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013259 (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"Journal of the ACM"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:19:51Z","timestamp":1557706791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}