Abstract

We consider a general class of optimization problems regarding spanning trees in directed graphs (arborescences). We present an algorithm for solving such problems, which can be considered as a generalization of Edmonds’ algorithm for the solution of the minimum sum arborescence problem. The considered class of optimization problems includes as special cases the standard minimum sum arborescence problem, the bottleneck and lexicographically optimal arborescence problem, as well as the widest-minimum sum arborescence problem.

Author Keywords: Minimum arborescence; Minimum directed spanning tree; Bottleneck arborescence; Lexicographically optimal arborescence; Widest-minimum spanning tree