{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:43:24Z","timestamp":1774975404210,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T00:00:00Z","timestamp":1404518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10878-014-9766-5","type":"journal-article","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T03:41:29Z","timestamp":1404445289000},"page":"511-530","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Optimal shortest path set problem in undirected graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Huili","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Xingang","family":"Wen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,5]]},"reference":[{"key":"9766_CR1","doi-asserted-by":"crossref","unstructured":"Adhari H, Dreibholz T, Becke M (2011) 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","DOI":"10.1109\/WAINA.2011.92"},{"issue":"2","key":"9766_CR2","doi-asserted-by":"crossref","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 (2000) On finding dissimilar paths. Eur J Oper Res 121(2):232\u2013246","journal-title":"Eur J Oper Res"},{"key":"9766_CR3","unstructured":"Bar-Noy A, Schieber B (1991) The canadian traveller problem. In: Proceedings of the second annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 261\u2013270"},{"issue":"1","key":"9766_CR4","doi-asserted-by":"crossref","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 (2007) On finding dissimilar pareto-optimal paths. Eur J Oper Res 162(1):70\u201382","journal-title":"Eur J Oper Res"},{"key":"9766_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"issue":"4","key":"9766_CR6","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 (2010) A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Trans Algorithms 6(4):64","journal-title":"ACM Trans Algorithms"},{"issue":"2","key":"9766_CR7","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein D (1998) Finding the $$k$$ k shortest paths. SIAM J Comput 28(2):652\u2013673","journal-title":"SIAM J Comput"},{"issue":"3","key":"9766_CR8","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M Fredman","year":"1987","unstructured":"Fredman M, Tarjan R (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3):596\u2013615","journal-title":"J ACM"},{"key":"9766_CR9","doi-asserted-by":"crossref","unstructured":"Hershberger J, Suri S (2001) Vickrey prices and shortest paths: what is an edge worth?. In: Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS01) pp 252\u2013259","DOI":"10.1109\/SFCS.2001.959899"},{"issue":"4","key":"9766_CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"N Katoh","year":"1982","unstructured":"Katoh N, Ibaraki T, Mine H (1982) An efficient algorithm for K shortest simple paths. Networks 12(4):411\u2013427","journal-title":"Networks"},{"issue":"4","key":"9766_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K Malik","year":"1989","unstructured":"Malik K, Mittal Ak, Gupta Sk (1989) The $$k$$ k most vital arcs in the shortest path problem. Oper Res Lett 8(4):223\u2013227","journal-title":"Oper Res Lett"},{"issue":"1","key":"9766_CR12","doi-asserted-by":"crossref","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 (1998) Finding the detour-critical edge of a shortest path between two nodes. Inform Process Lett 67(1):51\u201354","journal-title":"Inform Process Lett"},{"issue":"2","key":"9766_CR13","doi-asserted-by":"crossref","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 (2001) A faster computation of the most vital edge of a shortest path. Info Process Lett 79(2):81\u201385","journal-title":"Info Process Lett"},{"key":"9766_CR14","doi-asserted-by":"crossref","unstructured":"Wulff-Nilsen C (2010) Solving the replacement paths problem for planar directed graphs in $$O(n \\log n)$$ O ( n log n ) time. In: Proceedings of the 21th ACM-SIAM Symposium on Discrete Algorithms (SODA) pp 756\u2013765","DOI":"10.1137\/1.9781611973075.62"},{"issue":"3","key":"9766_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10878-007-9110-4","volume":"17","author":"P Xiao","year":"2009","unstructured":"Xiao P, Xu Y, Su B (2009) Finding an anti-risk path between two nodes in undirected graphs. J Comb Optim 17(3):235\u2013246","journal-title":"J Comb Optim"},{"issue":"2","key":"9766_CR16","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10878-008-9156-y","volume":"18","author":"Y Xu","year":"2009","unstructured":"Xu Y, Hu M, Su B, Zhu B, Zhu Z (2009) The Canadian traveller problem and its competitive analysis. J Comb Optim 18(2):195\u2013205","journal-title":"J Comb Optim"},{"key":"9766_CR17","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the K shortest loopless paths in a network. Manag Sci 17:712\u2013716","journal-title":"Manag Sci"},{"issue":"2","key":"9766_CR18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10878-012-9503-x","volume":"26","author":"H Zhang","year":"2013","unstructured":"Zhang H, Xu Y, Qin L (2013) The $$k$$ k -Canadian travelers problem with communication. J Comb Optim 26(2):251\u2013265","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9766-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9766-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9766-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T11:35:16Z","timestamp":1565609716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9766-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9766"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9766-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,5]]}}}