In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...