I dreamed about this math/algorithm puzzle earlier this morning.
There are N tables and M chairs on an infinite plane for a class, which consists of group discussions and individual works.
During the group discussions, each student can move his/her chair towards a table.
When the discussions are over, each student will need to move his/her chair to an individual table without sharing with other students.
What is the optimal transport for this transition from a given group discussion configuration to an individual work arrangement?
Leave a Reply