Question: Solve problem by modeling the given problem as a standard maximum flow problem on a suitable flow network There are k student organizations on campus
Solve problem by modeling the given problem as a standard maximum flow problem on a suitable flow network
There are k student organizations on campus 01, , Ok. Each of the n students on campus S1,,Sn belongs to one or more of these organi zations. Also, there are r fields of study F1, ,Fr, and each student has a unique primary field of study. Given positive integers u1,, ur you need to design an efficient algorithm to pick a committee of k students, one from each student organization such that there are no more than ui students with field of study Fi. Design your algorithm by modeling this problem as a suitable maximum flow problem. Be sure to argue correctness of your algorithm and bound its running time, making sure you make it as efficient as you can (in terms of an algorithm for the maximum flow problem )
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
