The minimum cost arborescence problem is a directed graph analogue of theminimum spanning tree problem in an undirected graph. In this paper, we study the minimum cost arborescence problem from the viewpoint of robustness of the optimal objective value, and we characterize an input graph in which the optimal objective value does not change even if we remove several arcs.
|ジャーナル||Japan Journal of Industrial and Applied Mathematics|
|出版ステータス||出版済み - 10 1 2012|
All Science Journal Classification (ASJC) codes
- Applied Mathematics