TY - GEN
T1 - Multi-stage Optimization of Matchings in Trees with Application to Kidney Exchange
AU - Mankowski, Michal
AU - Moshkov, Mikhail
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: Research reported in this publication was supported by King Abdullah University of Science and Technology (KAUST).
PY - 2017/7/22
Y1 - 2017/7/22
N2 - In 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.
AB - In 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.
UR - http://hdl.handle.net/10754/626059
UR - https://link.springer.com/chapter/10.1007%2F978-3-319-60837-2_10
UR - http://www.scopus.com/inward/record.url?scp=85022341270&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-60837-2_10
DO - 10.1007/978-3-319-60837-2_10
M3 - Conference contribution
AN - SCOPUS:85022341270
SN - 9783319608365
SP - 123
EP - 130
BT - Lecture Notes in Computer Science
PB - Springer Nature
ER -