Stable assignment with couples: Parameterized complexity and local search

Authors:
DáNiel Marx;Ildikó Schlotter
Affiliations:
Tel Aviv University, Israel;Budapest University of Technology and Economics, Hungary
Venue:
Discrete Optimization
Year:
2011

Citing 11
Cited 6

The lattice structure of the set of stable matchings with multiple partners

Mathematics of Operations Research
NP-complete stable matching problems

Journal of Algorithms
Color-coding

Journal of the ACM (JACM)
On local search and placement of meters in networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Hard variants of stable marriage

Theoretical Computer Science
The stable roommates problem with ties

Journal of Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
On the Hardness of Losing Weight

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A parameterized view on matroid optimization problems

Theoretical Computer Science
Searching the k-change neighborhood for TSP is W[1]-hard

Operations Research Letters

Stable matching with couples: An empirical study

Journal of Experimental Algorithmics (JEA)
On the hardness of losing weight

ACM Transactions on Algorithms (TALG)
The parameterized complexity of local search for TSP, more refined

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Backdoors to satisfaction

The Multivariate Algorithmic Revolution and Beyond
Parameterized complexity results for exact bayesian network structure learning

Journal of Artificial Intelligence Research
Matching with sizes (or scheduling with processing set restrictions)

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.