The cycle roommates problem: a hard case of kidney exchange

DOI10.1016/J.IPL.2007.02.003MaRDI QIDQ2379931zbMATH OpenOpenAlexFDO

Authors Robert W. Irving

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

zbMATH Keywords

algorithmscombinatorial problemscomputational complexitymatchingstability

Mathematics Subject Classification ID

Transversal (matching) theory (05D15) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Trade models (91B60)

Recommendations

• Hardness results for stable exchange problems
• Hardness results for stable exchange problems
• The roommates problem revisited
• On the complexity of exchange-stable roommates
• The kidney exchange problem: how hard is it to find a donor?

Cites work

• An efficient algorithm for the “stable roommates” problem
• College Admissions and the Stability of Marriage
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 3558960 (Why is no real title available?)
• scientific article; zbMATH DE number 5049926 (Why is no real title available?)
• Pairwise kidney exchange
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments

Cited in

(14)

• 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
• The stable marriage problem: an interdisciplinary review from the physicist's perspective
• Short trading cycles: paired kidney exchange with strict ordinal preferences
• Pareto optimality in the kidney exchange Problem
• Solving stable matching problems using answer set programming
• An efficient implementation of the Gale and Shapley ``propose-and-reject algorithm
• Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
• Hardness results for stable exchange problems
• Hardness results for stable exchange problems
• Review of the theory of stable matchings and contract systems
• Cycle selections
• Operational research approaches and mathematical models for kidney exchange: a literature survey and empirical evaluation

This page was built for publication: The cycle roommates problem: a hard case of kidney exchange

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379931)