{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:13:56Z","timestamp":1762272836932,"version":"3.40.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T00:00:00Z","timestamp":1633737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T00:00:00Z","timestamp":1633737600000},"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":[[2022,8]]},"DOI":"10.1007\/s10878-021-00819-w","type":"journal-article","created":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T17:22:53Z","timestamp":1633886573000},"page":"74-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The sum of root-leaf distance interdiction problem by upgrading edges\/nodes on trees"],"prefix":"10.1007","volume":"44","author":[{"given":"Qiao","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-1868","authenticated-orcid":false,"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[]},{"given":"Junhua","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Xinqiang","family":"Qian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,9]]},"reference":[{"issue":"6794","key":"819_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barabasi A (2000) Error and attack tolerance of complex networks. Nature 406(6794):378\u2013382","journal-title":"Nature"},{"issue":"1","key":"819_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.31801\/cfsuasmas.425508","volume":"68","author":"E Ayyldz","year":"2019","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\u2013450","journal-title":"Commun Fac Sci Univ Ankara Ser A1 Math Stat"},{"issue":"2","key":"819_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"},{"key":"819_CR4","doi-asserted-by":"crossref","unstructured":"Bazgan C, Nichterlein A et al (2015) A refined complexity analysis of finding the most vital edges for undirected shortest paths. In: Algorithms and complexity: lecture notes in computer science, vol 9079, pp 47\u201360","DOI":"10.1007\/978-3-319-18173-8_3"},{"issue":"1","key":"819_CR5","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":"819_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"},{"key":"819_CR7","unstructured":"COVID-19 Global Outbreak Live (2021) Phoenix News in China. https:\/\/news.ifeng.com\/c\/special\/7uLj4F83Cqm. Accessed 16 Sept 2021"},{"issue":"4","key":"819_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra OH, Kim CE (1975) Fast approximation algorithms for the knapsack and sum of subset problems. J Assoc Comput Mach 22(4):463\u2013468","journal-title":"J Assoc Comput Mach"},{"key":"819_CR9","unstructured":"Infectious Diseases, Characteristics of Infectious Diseases: Infectivity. Encyclopedia 360 in China. https:\/\/baike.so.com\/doc\/5378322-5614504.html. Accessed 3 Apr 2021"},{"key":"819_CR10","unstructured":"Italy, Iran in the Middle East, Korea spiralling out of control. Asymptomless people with poison are simply impossible to guard against! WeChat in China: things like the UK. https:\/\/mp.weixin.qq.com\/s\/ehvC-uQw3J71jH-h6lMjSQ. Accessed 23 Feb 2020"},{"key":"819_CR11","doi-asserted-by":"publisher","unstructured":"Jin C (2019) An improved FPTAS for 0-1 knapsack. In: Leibniz international proceedings in informatics, LIPIcs vol 132, no 76. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.76","DOI":"10.4230\/LIPIcs.ICALP.2019.76"},{"issue":"2","key":"819_CR12","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"},{"issue":"2","key":"819_CR13","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"},{"key":"819_CR14","volume-title":"Knapsack Problem: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack Problem: algorithms and computer implementations. John Wiley & Sons, Chichester"},{"key":"819_CR15","volume-title":"Introduction to algorithms","author":"HC Thoms","year":"2009","unstructured":"Thoms HC, Charles EL, Ronald LR, Clifford S (2009) Introduction to algorithms, 3rd edn. The MIT Press, Cambridge","edition":"3"},{"key":"819_CR16","unstructured":"Will COVID-19 patients be re-infected after they are cured and discharged from hospital? Xinhuanet in China. http:\/\/www.xinhuanet.com\/politics\/2020-02\/26\/c_1210491141.htm. Accessed 26 Feb 2020"},{"issue":"4","key":"819_CR17","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 (2021a) 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"},{"key":"819_CR18","doi-asserted-by":"crossref","unstructured":"Zhang Q, Guan XC, Wang H, Pardalos PM (2021b) Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance. Optim Lett 15(8): 2661\u20132680","DOI":"10.1007\/s11590-020-01687-9"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00819-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00819-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00819-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T10:32:17Z","timestamp":1744194737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00819-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["819"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00819-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,10,9]]},"assertion":[{"value":"24 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}