Abstract
A network for the transportation of supplies can be described as a rooted tree with a weight of a degree of congestion for each edge. We take the sum of root-leaf distance (SRD) on a rooted tree as the whole degree of congestion of the tree. Hence, we consider the SRD interdiction problem on trees with cardinality constraint by upgrading edges, denoted by (SDIPTC). It aims to maximize the SRD by upgrading the weights of N critical edges such that the total upgrade cost under some measurement is upper-bounded by a given value. The relevant minimum cost problem (MCSDIPTC) aims to minimize the total upgrade cost on the premise that the SRD is lower-bounded by a given value. We develop two different norms including weighted \(l_\infty \) norm and weighted bottleneck Hamming distance to measure the upgrade cost. We propose two binary search algorithms within O(\(n\log n\)) time for the problems (SDIPTC) under the two norms, respectively. For problems (MCSDIPTC), we propose two binary search algorithms within O(\(N n^2\)) and O(\(n \log n\)) under weighted \(l_\infty \) norm and weighted bottleneck Hamming distance, respectively. These problems are solved through their subproblems (SDIPT) and (MCSDIPT), in which we ignore the cardinality constraint on the number of upgraded edges. Finally, we design numerical experiments to show the effectiveness of these algorithms.








Similar content being viewed by others
Data availability
Data sharing is not applicable to this article as our datasets were generated randomly
References
Albert R, Jeong H, Barabási AL (2000) Error and attack tolerance of complex networks. Nature 406(6794):378–382
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
Ball MO, Golden BL, Vohra RV (1989) Finding the most vital arcs in a network. Oper Res Lett 8(2):73–76
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–37
Bazgan Cristina, Nichterlein André, 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–60. https://doi.org/10.1007/978-3-319-18173-8_3
Corley HW, Sha DY (1982) Most vital links and nodes in weighted networks. Oper Res Lett 1:157–161
Cormen TH, Leiserson CE, Rivest RL, et al. (2022) Introduction to algorithms. 4th edn. MIT press
Holzmann T, Smith JC (2021) The shortest path interdiction problem with randomized interdiction strategies: complexity and algorithms. Oper Res 69(1):82–99
Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97–111
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–233
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–469
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–2053
Sadana U, Delage E (2023) The value of randomized strategies in distributionally robust risk-averse network interdiction problems. INFORMS J Comput 35(1):216–232
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–93
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–987
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–2680
Funding
The Funding was provided by National Natural Science Foundation of China (grant no: 11471073)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no Conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Li, X., Guan, X., Zhang, Q. et al. The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees. J Comb Optim 48, 39 (2024). https://doi.org/10.1007/s10878-024-01230-x
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-024-01230-x
Keywords
- Network interdiction problems
- Tree
- Greedy algorithm
- Binary search method
- \(l_\infty \) norm
- Bottleneck Hamming distance