14 citations · 28 across the 17 of their papers we have counts for
Showing 2014 · cs.DMShow all
2 papers · 2 filters
cs.DM2014
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 with weights on the edges in …
cs.DM2014
Stable marriage and roommates problems with restricted edges: complexity and approximability
Ágnes Cseh, David F. Manlove
In the stable marriage and roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is…