Titlebook: ;

Vasodilation

JECT

anthropologist

Synthesis of Networks,(as economically as possible) on which a flow meeting given requirements can be realized. On the one hand, we will consider the case where all edges may be built with the same cost, and where we are looking for an undirected network with lower bounds on the maximal values of a flow between any two v

敲詐

Weighted matchings,lem of finding a matching of maximal weight in a network (.) (the .). In the bipartite case, this problem is equivalent to the assignment problem introduced in Example 10.1.4, so that the methods discussed in Chapter 10 apply. Nevertheless, we will give a further algorithm for the bipartite case, th