The cycle roommates problem: a hard case of kidney exchange
From MaRDI portal
Publication:2379931
DOI10.1016/j.ipl.2007.02.003zbMath1184.68271MaRDI QIDQ2379931
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.003
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
91B60: Trade models
05D15: Transversal (matching) theory
Related Items
Hardness results for stable exchange problems, The kidney exchange problem: how hard is it to find a donor?, Three-sided stable matchings with cyclic preferences, Circular stable matching and 3-way kidney transplant, Unnamed Item
Cites Work