Multi-stage Optimization of Matchings in Trees with Application to Kidney Exchange
KAUST DepartmentApplied Mathematics and Computational Science Program
Computer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Permanent link to this recordhttp://hdl.handle.net/10754/626059
MetadataShow full item record
AbstractIn this paper, we propose a method for multi-stage optimization of matchings in trees relative to different weight functions that assign positive weights to the edges of the trees. This method can be useful in transplantology where nodes of the tree correspond to pairs (donor, recipient) and two nodes (pairs) are connected by an edge if these pairs can exchange kidneys. Weight functions can characterize the number of exchanges, the importance of exchanges, or their compatibility.
CitationMankowski M, Moshkov M (2017) Multi-stage Optimization of Matchings in Trees with Application to Kidney Exchange. Lecture Notes in Computer Science: 123–130. Available: http://dx.doi.org/10.1007/978-3-319-60837-2_10.
SponsorsResearch reported in this publication was supported by King Abdullah University of Science and Technology (KAUST).
Conference/Event nameInternational Joint Conference on Rough Sets, IJCRS 2017