Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
From MaRDI portal
Publication:2944552
DOI10.1145/1240233.1240238zbMath1321.05207MaRDI QIDQ2944552
Kurt Mehlhorn, Telikepalli Kavitha, Dimitrios Michail, Katarzyna E. Paluch
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1240233.1240238
68Q25: Analysis of algorithms and problem complexity
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
91B68: Matching models
Related Items
Unnamed Item, Strongly Stable and Maximum Weakly Stable Noncrossing Matchings, Pairwise Preferences in the Stable Marriage Problem, Characterization of super-stable matchings, Strongly stable and maximum weakly stable noncrossing matchings, Improving solution times for stable matching problems through preprocessing, Pareto stability in two-sided many-to-many matching with weak preferences, Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints