Nonlinear methods in discrete optimization László Lovász Eötvös Loránd University, Budapest [email protected].
1 Maximum Flow Networks Suppose G = (V, E) is a directed network. Each edge (i,j) in E has an associated ‘capacity’ u ij. Goal: Determine the maximum amount.
Maximization of Network Survivability against Intelligent and Malicious Attacks (Cont’d) Presented by Erion Lin.
Maximum Flow Networks
