| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418499 | Discrete Applied Mathematics | 2016 | 8 Pages |
Abstract
We study a real-life modification of the classical house-swapping problem that is motivated by the existence of engaged pairs and divorcing couples. We show that the problem of finding a new house for the maximum number of agents is inapproximable, but fixed-parameter tractable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Katarína Cechlárová, Tamás Fleiner, Zsuzsanna Jankó,