Finding long chains in kidney exchange using the traveling salesman problem.

  title={Finding long chains in kidney exchange using the traveling salesman problem.},
  author={Ross Anderson and Itai Ashlagi and David Gamarnik and Alvin E. Roth},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  volume={112 3},
As of May 2014 there were more than 100,000 patients on the waiting list for a kidney transplant from a deceased donor. Although the preferred treatment is a kidney transplant, every year there are fewer donors than new patients, so the wait for a transplant continues to grow. To address this shortage, kidney paired donation (KPD) programs allow patients with living but biologically incompatible donors to exchange donors through cycles or chains initiated by altruistic (nondirected) donors… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 15 times over the past 90 days. VIEW TWEETS
30 Citations
21 References
Similar Papers


Publications referenced by this paper.

Similar Papers

Loading similar papers…