{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:10:04Z","timestamp":1648552204856},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,5]],"date-time":"2007-12-05T00:00:00Z","timestamp":1196812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10878-007-9120-2","type":"journal-article","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T16:10:55Z","timestamp":1196957455000},"page":"173-181","source":"Crossref","is-referenced-by-count":4,"title":["Finding the anti-block vital edge of a shortest path between two nodes"],"prefix":"10.1007","volume":"16","author":[{"given":"Bing","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingchuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,5]]},"reference":[{"key":"9120_CR1","unstructured":"Bar-Noy A, Schieber B (1991) The canadian traveler problem. In: Proceedings of the second annual ACM-SIAM symposium on discrete algorithms, pp 261\u2013270"},{"key":"9120_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.orl.2004.08.008","volume":"33","author":"AM Bhosle","year":"2005","unstructured":"Bhosle AM (2005) Improved algorithms for replacement paths problems in restricted graphs. Oper Res Lett 33:459\u2013466","journal-title":"Oper Res Lett"},{"key":"9120_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","volume":"1","author":"HW Corley","year":"1982","unstructured":"Corley HW, Sha DY (1982) Most vital links and nodes in weighted networks. Oper Res Lett 1:157\u2013161","journal-title":"Oper Res Lett"},{"key":"9120_CR4","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"},{"key":"9120_CR5","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 annual IEEE symposium on foundations of computer science, pp 252\u2013259","DOI":"10.1109\/SFCS.2001.959899"},{"key":"9120_CR6","doi-asserted-by":"crossref","unstructured":"Hershberger J, Suri S, Bhosle A (2003) On the difficulty of some shortest path problems. In: Proceedings of the 20th symposium on theoretical aspects of computer science, pp\u00a0343\u2013354","DOI":"10.1007\/3-540-36494-3_31"},{"issue":"4","key":"9120_CR7","first-page":"69","volume":"12","author":"Y Li","year":"2004","unstructured":"Li Y, Guo Y (2004) Study on vital edges of shortest paths in traffic and transportation networks. Chin J Manag Sci 12(4):69\u201373","journal-title":"Chin J Manag Sci"},{"key":"9120_CR8","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 most vital arcs in the shortest path problem. Oper Res Lett 8:223\u2013227","journal-title":"Oper Res Lett"},{"issue":"1","key":"9120_CR9","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. Inf Process Lett 67(1):51\u201354","journal-title":"Inf Process Lett"},{"issue":"2","key":"9120_CR10","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, Proietti G, Widmayer P (2001) A faster computation of the most vital edge of a shortest path between two nodes. Inf Process Lett 79(2):81\u201385","journal-title":"Inf Process Lett"},{"key":"9120_CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0304-3975(02)00438-3","volume":"296","author":"E Nardelli","year":"2003","unstructured":"Nardelli E, Proietti G, Widmayer P (2003) Finding the most vital node of a shortest path. Theor Comput Sci 296:167\u2013177","journal-title":"Theor Comput Sci"},{"key":"9120_CR12","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/BFb0035787","volume-title":"Automata, languages and programming","author":"CH Papadimitriou","year":"1989","unstructured":"Papadimitriou CH, Yannakakis M (1989) Shortest paths without a map. In: Ronchi Della Rocca S, Ausiello\u00a0G, Dezani-Ciancaglini M (eds) Automata, languages and programming. Lecture notes in computer science, vol 372. Springer, Heidelberg, pp 610\u2013620"},{"key":"9120_CR13","unstructured":"Su B (2005) Research on strategy for sequential unexpected blockages during the transportation process. PhD dissertation"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9120-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9120-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9120-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9120-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,5]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9120"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9120-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,5]]}}}