Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs

Discrete Mathematics, Algorithms and Applications

Volumn 1, Issue 4, 2009, Pages 499-517

  Biró, Péter ^a   Manlove, David F ^a   Rizzi, Romeo ^b  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

approximation algorithm; APX completeness; Directed graph; exact algorithm; kidney paired donation; triangle packing

Indexed keywords

EID: 77954696249     PISSN: 17938309     EISSN: 17938317     Source Type: Journal    
DOI: 10.1142/S1793830909000373     Document Type: Article

References (47)

1. D. J. Abraham, A. Blum and T. Sandholm, Clearing algorithms for barter-exchange markets: Enabling nationwide kidney exchanges, In Proc. EC '07: The Eighth ACM Conference on Electronic Commerce, ACM (2007), pp. 295-304.
2. Alliance for Paired Donation website, http://www.paireddonation.org.
3. E. M. Arkin and R. Hassin, On local search for weighted packing problems, Math. Oper. Res. 23 (1998) 640-648.
4. BBC news website. 'Six-way' kidney transplant first (9 April 2008), http://news.bbc. co.uk/1/health/7338437.stm.
5. P. Berman, A d/2 approximation for maximum weight independent set in d-claw free graphs, in Proc. SWAT 2000: The 7th Scandinavian Workshop on Algorithm Theory, Vol. 1851, Lecture Notes in Computer Science (Springer, 2000), pp. 214-219.
6. P. Biro and K. Cechlarova, Inapproximability of the kidney exchange problem, Inform. Proc. Lett. 101 (2007) 199-202.
7. P. Biro, D. F. Manlove and R. Rizzi, Maximum weight cycle packing in optimal kidney exchange programs, Technical report, no. TR-2009-298, University of Glasgow, Department of Computing Science, 2009.
8. P. Biro and E. McDermid, Three-sided stable matchings with cyclic preferences, to appear in Algorithmica (2010).
9. A. Caprara and R. Rizzi, Packing triangles in bounded degree graphs, Inform. Proc. Lett. 84 (2002) 175-180.
10. K. Cechlarova, T. Fleiner and D. Manlove, The kidney exchange game, in Proc. SOR '05: The 8th International Symposium on Operations Research in Slovenia (2005), pp. 77-83. Technical Report, IM Preprint series A, no. 5/2005, PJ Safarik University, Faculty of Science, Institute of Mathematics, 2005.
11. K. Cechlarova and V. Lacko, The kidney exchange game: How hard is to find a donor Technical report, IM Preprint series A, no. 4/2006, PJ Safarik University, Faculty of Science, Institute of Mathematics, 2006.
12. B. Chandra and M. Halldorsson, Greedy local improvement and weighted set packing approximation, in Proc. SODA '99: The 10th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM (1999), pp. 169-176.
13. Z.-Z. Chen, R. Tanahashi and L. Wang, An improved randomized approximation algorithm for maximum triangle packing, Discrete Appl. Math. 157 (2009) 1640-1646.
14. M. Chlebk and J. Chlebkova, Approximating hardness for small occurrence instances of NP-hard problems, in Proc. CIAC 2003: The 5th Italian Conference on Algorithms and Complexity, Vol. 2653, Lecture Notes in Computer Science (Springer, 2003), pp. 152-164.
15. J. Edmonds, Maximum matching and a polyhedron with 0, 1-vertices. J Res. NBS B 69B (1965) 125-130.
16. J. Edmonds, Paths, trees and flowers, Can. J. Math. 17 (1965) 449-467.
17. H. Fernau, Parameterized algorithmics: A graph-theoretic approach. Habilitationsschrift, Universität Tübingen, Germany and University of Newcastle, Australia, April 2005, http://www.cs.uu.nl/groups/AD/fernau-habil.pdf.
18. H. N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, in Proc. SODA '90: The 1st Annual ACM-SIAM Symposium on Discrete Algorithms, ACM (1990), pp. 434-443.
19. M. R. Garey and D. S. Johnson, Computers and Intractability (W.H. Freeman and Co., 1979).
20. R. Hassin and S. Rubinstein, An approximation algorithm for maximum triangle packing, Discrete Appl. Math. 154 (2006) 971-979.
21. [Erratum: 154 (2006) 2620-2620].
22. C. A. J. Hurkens and A. Schrijver, On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2 (1989) 68-72.
23. R. J. Johnson, J. E. Allen, S. V. Fuggle, J. A. Bradley and C. J. Rudge, Early experience of paired living kidney donation in the United Kingdom, Transplantation 86 (2008) 1672-1677.
24. V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Inform. Proc. Lett. 37 (1991) 27-35.
25. K. M. Keizer, M. de Klerk, B. J. J. M. Haase-Kromwijk and W. Weimar, The Dutch algorithm for allocation in living donor kidney exchange, Transplant. Proc. 37 (2005) 589-591.
26. M. de Klerk, K. M. Keizer, F. H. J. Claas, M. Witvliet, B. J. J. M. Haase-Kromwijk, and W. Weimar, The Dutch national living donor kidney exchange program, Am. J. Transplant. 5 (2005) 2302-2305.
27. J. Y.Kwak, O. J. Kwon, K. S. Lee, C.M.Kang, H. Y. Park and J. H.Kim, Exchangedonor program in kidney transplantation: A single-center experience, Transplant. Proc. 31 (1999) 344-345.
28. L. Lovasz and M. D. Plummer, Matching Theory, No. 29 in Annals of Discrete Mathematics (North-Holland, 1986).
29. M. Lucan, P. Rotariu, D. Neculoiu and G. Iacob, Kidney exchange program: A viable alternative in countries with low rate of cadaver harvesting, Transplant. Proc. 35 (2003) 933-934.
30. M. Lucan, Five years of single-center experience with paired kidney exchange transplantation, Transplant. Proc. 39 (2007) 1371-1375.
31. G. Manic and Y.Wakabayash, Packing triangles in low degree graphs and indifference graphs, Discrete Math. 308 (2008) 1455-1471.
32. K. Mehlhorn and S. Naher, LEDA: A Platform for Combinatorial and Geometric Computing (Cambridge University Press, 1999).
33. S. Micali and V. V. Vazirani, An O(p|V | • |E|) algorithm for finding maximum matching in general graphs, in Proc. FOCS '80: The 21st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society (1980), pp. 17-27.
34. New England Program for Kidney Exchange website, http://www.nepke.org.
35. Organ Donation and Transplantation Directorate, NHS Blood and Transplant website, http://www.organdonation.nhs.uk.
36. Paired Donation Network website, http://www.paireddonationnetwork.org.
37. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. Syst. Sci. 43 (1991) 425-440.
38. K. Park, J. H. Lee, S. I. Kim and Y. S. Kim, Exchange living-donor kidney transplantation: Diminution of donor organ shortage, Transplant. Proc. 36 (2004) 2949-2951.
39. K. Park, J. II Moon, S. II Kim and Y. S. Kim, Exchange-donor program in kidney transplantation, Transplant. Proc. 31 (1999) 356-357.
40. A. E. Roth, T. Sönmez and M. U. Unver, Kidney exchange, Q. J. Econ. 119 (2004) 457-488.
41. A. E. Roth, T. Sönmez and M. U. Unver, A kidney exchange clearinghouse in New England, Am. Econ. Rev. Papers Proc. 95 (2005) 376-380.
42. A. E. Roth, T. Sönmez and M. U. Unver, Pairwise kidney exchange, J. Econ. Theor. 125 (2005) 151-188.
43. A. E. Roth, T. Sönmez and M. U. Unver, Coincidence of wants in markets with compatibility based preferences, Am. Econ. Rev. 97 (2007) 828-851.
44. S. L. Saidman, A. E. Roth, T. Sönmez, M. U. Unver and S. L. Delmonico, Increasing the opportunity of live kidney donation by matching for two and three way exchanges, Transplantation 81(5) (2006) 773-782.
45. S. L. Saidman, A. E. Roth, T. Sönmez, M. U. U nver and S. L. Delmonico, Utilizing list exchange and undirected good samaritan donation through chain paired kidney exchanges, Am. J. Transplant. 6 (2006) 2694-2705.
46. S. L. Segev, S. E. Gentry, D. S. Warren, B. Reeb and R. A. Montgomery, Kidney paired donation and optimizing the use of live donor organs, J. Am. Med. Assoc. 293 (2005) 1883-1890.
47. United Network for Organ Sharing website, http://www.unos.org.