Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
From MaRDI portal
Publication:1029707
DOI10.1007/s10878-007-9133-xzbMath1165.91442OpenAlexW2044175003MaRDI QIDQ1029707
David F. Manlove, Robert W. Irving
Publication date: 13 July 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://eprints.gla.ac.uk/4567/1/4567.pdf
Related Items (13)
Integer programming methods for special college admissions problems ⋮ Robust and approximately stable marriages under partial information ⋮ Improved approximation algorithms for two variants of the stable marriage problem with ties ⋮ Parameterized complexity and local search approaches for the stable marriage problem with ties ⋮ Better and Simpler Approximation Algorithms for the Stable Marriage Problem ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ Linear time local approximation algorithm for maximum stable marriage ⋮ Local search approaches in stable matching problems ⋮ A 25/17-approximation algorithm for the stable marriage problem with one-sided ties ⋮ Better and simpler approximation algorithms for the stable marriage problem ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ The stable marriage problem with master preference lists ⋮ College admissions with ties and common quotas: integer programming approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the stable matching problem
- Stable marriage and indifference
- Approximability results for stable marriage problems with ties.
- Hard variants of stable marriage.
- Randomized approximation of the stable marriage problem
- On a generalization of the stable roommates problem
- An $\frac{8}{5}$ -Approximation Algorithm for a Hard Variant of Stable Marriage
- The Complexity of Counting Stable Marriages
- Algorithm Theory - SWAT 2004
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Algorithms - ESA 2003
- Algorithms and Computation
- College Admissions and the Stability of Marriage
This page was built for publication: Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
