Stable assignment with couples: Parameterized complexity and local search

Citations of this article
Mendeley users who have this article in their library.


We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents are allowed to form pairs and submit joint rankings over hospitals. We use the framework of parameterized complexity, considering the number of couples as a parameter. We also apply a local search approach, and examine the possibilities for giving FPT algorithms applicable in this context. Furthermore, we also investigate the matching problem containing couples that is the simplified version of the Hospitals/Residents with Couples problem modeling the case when no preferences are given. © 2010 Elsevier B.V. All rights reserved.




Marx, D., & Schlotter, I. (2011). Stable assignment with couples: Parameterized complexity and local search. Discrete Optimization, 8(1), 25–40.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free