## Archive for March, 2016

### Minimum-cost Flows

15Mar16

About a month ago, the Facebook Hacker Cup included a nice programming problem involving a certain kind of matching. The min-cost bipartite matching problem can be stated like this: You have a number P of people, and a number Q ≤ P of jobs. Each person is willing to do any of the jobs, but each person will charge a different price for each job. You are only allowed […]

Filed under: algorithms, graphs, programming | Leave a Comment