14 citations · 28 across the 17 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
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…
cs.DS2014
Improved Algorithmic Results for Unsplittable Stable Allocation Problems
Ágnes Cseh, Brian C. Dean
The stable allocation problem is a many-to-many generalization of the well-known stable marriage problem, where we seek a bipartite assignment between, say, jobs (of varying sizes)…