subject
Mathematics, 03.12.2019 05:40 sherlock19

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.

ansver
Answers: 2

Another question on Mathematics

question
Mathematics, 04.02.2019 06:19
Tom wants to order tickets online so that he and three of his friends can go to a water park the cost of the tickets is 16.00 per person there is also a 2.50 one-time service fee for ordering tickets online write an expression in term of n that represents the cost for n ordering tickets online
Answers: 1
question
Mathematics, 04.02.2019 04:53
Which expression will have the same sum as 3_8 + 1/4?
Answers: 1
question
Mathematics, 03.02.2019 23:52
Find the area of the regular hexagon if a side is 20 cm.
Answers: 2
question
Mathematics, 03.02.2019 23:22
What is coefficient of the term of degree of degree 5 in the polynomial below
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
question
Social Studies, 24.02.2019 19:41
question
Mathematics, 02.08.2018 23:22
Questions on the website: 6675995