Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
From MaRDI portal
Publication:2944552
DOI10.1145/1240233.1240238zbMath1321.05207OpenAlexW2085383556MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Matching models (91B68)
Related Items
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings, Characterization of super-stable matchings, Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints, Balancing stability and efficiency in team formation as a generalized roommate problem, Pareto stability in two-sided many-to-many matching with weak preferences, Strongly stable and maximum weakly stable noncrossing matchings, Unnamed Item, Improving solution times for stable matching problems through preprocessing, Pairwise Preferences in the Stable Marriage Problem
