Abstract
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.
Original language | English (US) |
---|---|
Title of host publication | Rough Sets - International Joint Conference, IJCRS 2017, Proceedings, |
Editors | Dun Liu, Yiyu Yao, Beata Zielosko, Davide Ciucci, Lech Polkowski, Piotr Artiemjew, Dominik Slezak |
Publisher | Springer Verlag |
Pages | 123-130 |
Number of pages | 8 |
ISBN (Print) | 9783319608365 |
DOIs | |
State | Published - 2017 |
Event | International Joint Conference on Rough Sets, IJCRS 2017 - Olsztyn, Poland Duration: Jul 3 2017 → Jul 7 2017 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10313 LNAI |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | International Joint Conference on Rough Sets, IJCRS 2017 |
---|---|
Country/Territory | Poland |
City | Olsztyn |
Period | 07/3/17 → 07/7/17 |
Bibliographical note
Publisher Copyright:© Springer International Publishing AG 2017.
Keywords
- Matching
- Multi-stage optimization
- Tree
- Weight function
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science