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 problem modeling the case when no preferences are given. © 2009 Springer-Verlag.
CITATION STYLE
Marx, D., & Schlotter, I. (2009). Stable assignment with couples: Parameterized complexity and local search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5917 LNCS, pp. 300–311). https://doi.org/10.1007/978-3-642-11269-0_25
Mendeley helps you to discover research relevant for your work.