Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.dam.2016.01.023 | Discrete Applied Mathematics |
Keywords | Field | DocType |
House-swapping,Inapproximability,Fixed-parameter tractability | Discrete mathematics,Swap (computer programming),Combinatorics,Mathematics | Journal |
Volume | Issue | ISSN |
206 | C | 0166-218X |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katarína Cechlárová | 1 | 226 | 28.02 |
| Tamás Fleiner | 2 | 241 | 27.45 |
| Zsuzsanna Jankó | 3 | 5 | 2.23 |