Inverse min-max spanning r-arborescence problem under the weighted sum-type Hamming distance
M. Mohaghegh, Fahimeh Baroughi · Asian-European Journal of Mathematics · 2016
The inverse min-max spanning [Formula: see text]-arborescence problem under the weighted sum-type Hamming distance on graphs is to modify the edge cost vector with respect to given modification bounds such that a given spanning [Formula: see text]-arborescence becomes a min-max spanning [Formula: see text]-arborescence and the total modification cost under the sum-type Hamming distance for all edges is minimized. It is shown that the problem is solvable in strongly polynomial time.