Multi-stage optimization of matchings in trees with application to kidney exchange

Michal Mankowski*, Mikhail Moshkov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

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 languageEnglish (US)
Title of host publicationRough Sets - International Joint Conference, IJCRS 2017, Proceedings,
EditorsDun Liu, Yiyu Yao, Beata Zielosko, Davide Ciucci, Lech Polkowski, Piotr Artiemjew, Dominik Slezak
PublisherSpringer Verlag
Pages123-130
Number of pages8
ISBN (Print)9783319608365
DOIs
StatePublished - 2017
EventInternational Joint Conference on Rough Sets, IJCRS 2017 - Olsztyn, Poland
Duration: Jul 3 2017Jul 7 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10313 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Joint Conference on Rough Sets, IJCRS 2017
Country/TerritoryPoland
CityOlsztyn
Period07/3/1707/7/17

Keywords

  • Matching
  • Multi-stage optimization
  • Tree
  • Weight function

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Multi-stage optimization of matchings in trees with application to kidney exchange'. Together they form a unique fingerprint.

Cite this