… Despite the popularity of its cousin, the MST, the minimum spanning arborescence on directed
graphs with random edge weights has not received as much attention from the probability …

… We shall return to different reductions of one problem to another in Chapter 15 In the rest
of this section we consider the MINIMUM SPANNING TREE PROBLEM only. Let us first count …

We address the problem of finding an arborescence of minimum total edge weight rooted at
a given vertex in a directed, edge-weighted graph. If the arborescence must span all vertices …

… of the minimum spanning arborescence rooted at node 0 (which, as pointed out before, can
be computed in polynomial time). Furthermore, if this optimal spanning arborescence is such …

… finding the spanning arborescence which better approaches to that of minimum overall cost
… By Fs we denote the optimal objective value of the Minimum Spanning Arborescence (MSA) …

… called a rooted notnecessarily-spanning arborescence (RA) of G… -spanning arborescence
as simply arborescence for ease of … the problem reduces to a minimum spanning tree problem. …

… methods for finding a minimum spanning arborescence of a digraph [ IO]. Note, however, …
a minimum spanning arborescence is not necessarily a min-max spanning arborescence (…

… results and applications of the Minimum Spanning Arborescence Problem in a Directed … a
spanning arborescence with root r with a minimum sum of its arc costs. The minimum spanning …

… well-known results for arborescences. In the first half of this survey, we consider … minimum-cost
arborescence problem. The goal of this problem is to find a minimum-cost arborescence …

… , a new arborescence must be recomputed for each choice of supertags. This problem can
be seen as instance of the Generalized Maximum Spanning Arborescence problem, an NP…