, 03.12.2019 05:40

# You are organizing a dinner with n di erent groups of friends, with each group composed of gi members with i 2 f1; : : : ; ng. you have m tables each for r people, and you want want to impose that all friends from the same group should be seated in di erent tables. in this way you will obligate your friends ( nally) to chat with people who does not belong to their closest groups. show (graphically) that using a maximum ow formulation we can nd a feasible arrangement of friends to tables that satisfy the rule mentioned above, or show that it is not possible. hint: imagine that someone solves the maximum flow problem (that you need to find) and tells you what's the maximum flow. using that number, how can you know if it was possible to nd the arrangement suggested in the problem statement or not.

Answers: 2

### Another question on Mathematics

Mathematics, 04.02.2019 20:20
Amotorboat can maintain a constant speed of 12 miles per hour relative to the water. the boat makes a trip upstream to a certain point in 54 ? minutes; the return trip takes 27 minutes. what is the speed of the? current?
Answers: 3
Mathematics, 04.02.2019 02:40
Simplify the expression. -2/5(10+15m-20n)
Answers: 1
Mathematics, 04.02.2019 02:25
State if the two triangles are congruent. if they are, state how you know?
Answers: 1
Mathematics, 03.02.2019 23:00
Define multiplicative inverse. give an example of a number and its multiplicative inverse.
Answers: 1
You know the right answer?
You are organizing a dinner with n di erent groups of friends, with each group composed of gi member...
Questions on the website: 6713912