Matchings with lower quotas: Algorithms and complexity

Ashwin Arulselvan, Ágnes Cseh, Martin Groß +2

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph $G=(A\cup P,E)$ with weights on the edges in $E$…