Skip to main content
SpringerLink
Log in

Multi-stage Optimization of Matchings in Trees with Application to Kidney Exchange

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10313))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. AbuBekr, J., Chikalov, I., Hussain, S., Moshkov, M.: Sequential optimization of paths in directed graphs relative to different cost functions. In: Sato, M., Matsuoka, S., Sloot, P.M.A., van Albada, G.D., Dongarra, J. (eds.) International Conference on Computational Science, ICCS 2011, Nanyang Technological University, Singapore, 1–3 June 2011. Procedia Computer Science, vol. 4, pp. 1272–1277. Elsevier (2011)

    Google Scholar 

  2. Alkhalid, A., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Optimization and analysis of decision trees and rules: dynamic programming approach. Int. J. Gen. Syst. 42(6), 614–634 (2013)

    Article  MathSciNet  Google Scholar 

  3. Alnafie, M., Chikalov, I., Hussain, S., Moshkov, M.: Sequential optimization of binary search trees for multiple cost functions. In: Potanin, A., Viglas, T. (eds.) Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011. CRPIT, vol. 119, pp. 41–44. Australian Computer Society (2011)

    Google Scholar 

  4. Chikalov, I., Hussain, S., Moshkov, M.: Sequential optimization of matrix chain multiplication relative to different cost functions. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 157–165. Springer, Heidelberg (2011). doi:10.1007/978-3-642-18381-2_13

    Chapter  MATH  Google Scholar 

  5. Chikalov, I., Hussain, S., Moshkov, M., Odat, E.: Sequential optimization of global sequence alignments relative to different cost functions. In: ACM International Conference on Convergence and Hybrid Information Technology, ICHIT 2010, Daejeon, Korea, 26–28 August 2010. ACM (2010)

    Google Scholar 

  6. Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449–467 (1965)

    Article  MathSciNet  Google Scholar 

  7. Gentry, S.E.: Optimization over graphs for kidney paired donation. In: Lim, G.J., Lee, E.K. (eds.) Optimization in Medicine and Biology, pp. 177–195. Auerbach Publications, Taylor & Francis Group, Boca Raton (2008)

    Google Scholar 

  8. Goddard, W.: Introduction to algorithms, part 2: Greedy algorithms, dynamic programming, graph algorithms (2004)

    Google Scholar 

  9. Halappanavar, M.: Algorithms for vertex-weighted matching in graphs. Ph.D. thesis, Old Dominion University, Norfolk, VA, USA (2009)

    Google Scholar 

  10. Lovász, L., Plummer, M.D.: Matching Theory (AMS Chelsea Publishing). Akadémiai Kiadó - North Holland, Budapest (1986)

    Google Scholar 

  11. Pawlak, Z.: Rough Sets - Theoretical Aspect of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  12. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Inf. Sci. 177(1), 3–27 (2007)

    Article  MathSciNet  Google Scholar 

  13. Segev, D.L., Gentry, S.E., Warren, D.S., Reeb, B., Montgomery, R.A.: Kidney paired donation and optimizing the use of live donor organs. J. Am. Med. Assoc. 293(15), 1883–1890 (2005)

    Article  Google Scholar 

Download references

Acknowledgments

Research reported in this publication was supported by King Abdullah University of Science and Technology (KAUST).

Author information

Authors and Affiliations

  1. Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal, 23955-6900, Saudi Arabia

    Michal Mankowski & Mikhail Moshkov

Authors
  1. Michal Mankowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michal Mankowski .

Editor information

Editors and Affiliations

  1. Polish-Japanese Academy of Information Technology, Warsaw, Poland

    Lech Polkowski

  2. University of Regina, Regina, SK, Canada

    Yiyu Yao

  3. University of Warmia and Mazury, Olsztyn, Poland

    Piotr Artiemjew

  4. University of Milano-Bicocca, Milano, Italy

    Davide Ciucci

  5. Southwest Jiaotong University, Chengdu, China

    Dun Liu

  6. Warsaw University, Warszawa, Poland

    Dominik Ślęzak

  7. Silesian University, Sosnowiec, Poland

    Beata Zielosko

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Mankowski, M., Moshkov, M. (2017). Multi-stage Optimization of Matchings in Trees with Application to Kidney Exchange. In: Polkowski, L., et al. Rough Sets. IJCRS 2017. Lecture Notes in Computer Science(), vol 10313. Springer, Cham. https://doi.org/10.1007/978-3-319-60837-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60837-2_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60836-5

  • Online ISBN: 978-3-319-60837-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation