{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:18:28Z","timestamp":1760015908979,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T00:00:00Z","timestamp":1730764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T00:00:00Z","timestamp":1730764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471073"],"award-info":[{"award-number":["11471073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10878-024-01230-x","type":"journal-article","created":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T15:56:29Z","timestamp":1730822189000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees"],"prefix":"10.1007","volume":"48","author":[{"given":"Xiao","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-1868","authenticated-orcid":false,"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[]},{"given":"Qiao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xinyi","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,5]]},"reference":[{"issue":"6794","key":"1230_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barab\u00e1si AL (2000) Error and attack tolerance of complex networks. Nature 406(6794):378\u2013382","journal-title":"Nature"},{"doi-asserted-by":"crossref","unstructured":"Ayyldz E, Zelik G, Gencer CT (2019) Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire. Commun Fac Sci Univ Ankara Ser A1 Math Stat 68(1):441-450","key":"1230_CR2","DOI":"10.31801\/cfsuasmas.425508"},{"issue":"2","key":"1230_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0167-6377(89)90003-5","volume":"8","author":"MO Ball","year":"1989","unstructured":"Ball MO, Golden BL, Vohra RV (1989) Finding the most vital arcs in a network. Oper Res Lett 8(2):73\u201376","journal-title":"Oper Res Lett"},{"issue":"1","key":"1230_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.21832","volume":"73","author":"C Bazgan","year":"2019","unstructured":"Bazgan C, Fluschnik T, Nichterlein A, Niedermeier R, Stahlberg M (2019) A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Networks 73(1):23\u201337","journal-title":"Networks"},{"key":"1230_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-18173-8_3","volume-title":"Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings","author":"Cristina Bazgan","year":"2015","unstructured":"Bazgan Cristina, Nichterlein Andr\u00e9, Niedermeier Rolf (2015) A refined complexity analysis of finding the most vital edges for undirected shortest paths. In: Paschos Vangelis Th., Widmayer Peter (eds) Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Springer International Publishing, Cham, pp 47\u201360. https:\/\/doi.org\/10.1007\/978-3-319-18173-8_3"},{"key":"1230_CR6","doi-asserted-by":"publisher","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"},{"unstructured":"Cormen TH, Leiserson CE, Rivest RL, et al. (2022) Introduction to algorithms. 4th edn. MIT press","key":"1230_CR7"},{"issue":"1","key":"1230_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/opre.2020.2023","volume":"69","author":"T Holzmann","year":"2021","unstructured":"Holzmann T, Smith JC (2021) The shortest path interdiction problem with randomized interdiction strategies: complexity and algorithms. Oper Res 69(1):82\u201399","journal-title":"Oper Res"},{"issue":"2","key":"1230_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97\u2013111","journal-title":"Networks"},{"issue":"2","key":"1230_CR10","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s00224-007-9025-6","volume":"43","author":"L Khachiyan","year":"2008","unstructured":"Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Rudolf G, Zhao J (2008) On short paths interdiction problems: total and node-wise limited interdiction. Theory Comput Syst 43(2):204\u2013233","journal-title":"Theory Comput Syst"},{"key":"1230_CR11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s11590-022-01916-3","volume":"17","author":"Y Lei","year":"2023","unstructured":"Lei Y, Shao H, Wu T et al (2023) An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance. Optim Lett 17:453\u2013469","journal-title":"Optim Lett"},{"issue":"2","key":"1230_CR12","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1007\/s11590-019-01527-5","volume":"14","author":"Y Magnouche","year":"2020","unstructured":"Magnouche Y, Martin S (2020) Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm. Optim Lett 14(2):2039\u20132053","journal-title":"Optim Lett"},{"issue":"1","key":"1230_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1287\/ijoc.2022.1257","volume":"35","author":"U Sadana","year":"2023","unstructured":"Sadana U, Delage E (2023) The value of randomized strategies in distributionally robust risk-averse network interdiction problems. INFORMS J Comput 35(1):216\u2013232","journal-title":"INFORMS J Comput"},{"issue":"1","key":"1230_CR14","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s10878-021-00819-w","volume":"44","author":"Q Zhang","year":"2022","unstructured":"Zhang Q, Guan XC, Jia JH et al (2022) The sum of root-leaf distance interdiction problem by upgrading edges\/nodes on trees. J Comb Optim 44(1):74\u201393","journal-title":"J Comb Optim"},{"issue":"4","key":"1230_CR15","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s10898-020-00958-0","volume":"79","author":"Q Zhang","year":"2021","unstructured":"Zhang Q, Guan XC, Pardalos PM (2021) Maximum shortest path interdiction problem by upgrading edges on trees under weighted $$l_1$$ norm. J Global Optim 79(4):959\u2013987","journal-title":"J Global Optim"},{"issue":"8","key":"1230_CR16","doi-asserted-by":"publisher","first-page":"2661","DOI":"10.1007\/s11590-020-01687-9","volume":"15","author":"Q Zhang","year":"2021","unstructured":"Zhang Q, Guan XC, Wang H, Pardalos PM (2021) Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance. Optim Lett 15(8):2661\u20132680","journal-title":"Optim Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01230-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01230-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01230-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T21:24:18Z","timestamp":1732051458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01230-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,5]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1230"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01230-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,11,5]]},"assertion":[{"value":"17 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"39"}}