Finding large stable matchings
From MaRDI portal
Publication:5406194
DOI10.1145/1498698.1537595zbMath1284.68670OpenAlexW2047812342MaRDI QIDQ5406194
Robert W. Irving, David F. Manlove
Publication date: 1 April 2014
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: http://eprints.gla.ac.uk/25733/1/25733.pdf
Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Matching models (91B68)
Related Items (11)
College admissions with stable score-limits ⋮ On the number of employed in the matching model ⋮ Linear time local approximation algorithm for maximum stable marriage ⋮ Local search approaches in stable matching problems ⋮ Faster and simpler approximation of stable matchings ⋮ Mathematical models for stable matching problems with ties and incomplete lists ⋮ Matching with indifferences: a comparison of algorithms in the context of course allocation ⋮ Better and simpler approximation algorithms for the stable marriage problem ⋮ Improving solution times for stable matching problems through preprocessing ⋮ Coalitional permutation manipulations in the Gale-Shapley algorithm ⋮ Size versus fairness in the assignment problem
This page was built for publication: Finding large stable matchings
