Efficient Algorithms for the Hospitals/Residents Problem with Couples: New Polynomial-Time Solutions and Hardness Results

Polynomial-time algorithms can be designed to find near-feasible stable matchings in the Hospitals/Residents problem with Couples, even with strong restrictions on the couples' preferences.