Project Description

We have a theoretical paper outlining multiple algorithms for the "Kidney Exchange" problem -- see Vaishali's Grad Slam Video: https://vimeo.com/822376122

It would be interesting to test these ideas and algorithms out in practice by implementing variations of the algorithms and testing them on benchmark data. The project will involve implementation, but also algorithm design ( to make an algorithm work in practice you often have to implement it "wrong" in the "right way", and finding the right way to do it wrong is quite tricky! )

 

Prerequisite Information

Important: CS40 or Math 8

Nice-to-have: CS130A

It helps if students have already taken CS40 or Math 8, or at least have seen some discrete math before (sets, graphs). Also great if they have taken 130A and/or 130B, although we can hardly expect that for sophomores. Historically a small but non negligible fraction of our undergraduates have experience with competitive programming ( such as USACO or ICPC ), that is certainly not necessary but can help compensate for the fact that they have not taken courses such as 40, 130A, 130B

Team Members

  • Ashwin Rajan
  • Xinghan Yang
  • Isabella Ward
  • Edwin Medrano Villela

Professor and Mentors

  • Prof. Daniel Lokshtanov
  • Grad mentors: Vaishali Surianarayan, Ursula Hebert-Johnson, and Chinmay Sonar

Meeting Times

  • Mentor Meetings
    • TBD
  • ERSP Team Meetings
    • Wednesdays, 7:15-9:15

Research Logs