Question: ( b ) ( 20 points ) In formulating flow problems , we assume that there is at most one directed edge between any two

( b ) ( 20 points ) In formulating flow problems , we assume that there is at most one directed edge between any two nodes . Suppose we have a network with multi- edges . now there may be be multiple directed edges going from node i to node j , each possibly with and D different capacities and weights . Show how to reduce this problem to the standard one without multi- edges
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
