Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems

Journal of Combinatorial Optimization

Volumn 16, Issue 3, 2008, Pages 279-292

  Irving, Robert W ^a   Manlove, David F ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Approximation algorithms; NP hard problems; Stable matching; Weak stability

Indexed keywords

NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION;

CARDINALITY; DIFFERENT SIZES; MATCHINGS; NP-HARD; NP-HARD PROBLEMS; POLYNOMIAL-TIME; PREFERENCE LISTS; STABLE MATCHING; WEAK STABILITY;

APPROXIMATION ALGORITHMS;

EID: 49749151458     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9133-x     Document Type: Article

References (24)

1. Canadian Resident Matching Service website http://www.carms.ca/
2. Cechlárová K, Fleiner T (2005) On a generalization of the stable roommates problem. ACM Trans Algorithms 1(1):143-156
3. Gabow HN (1983) An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proceedings of STOC '83: the 15th annual ACM symposium on theory of computing. ACM, pp 448-456
4. Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69:9-15
5. Gale D, Sotomayor M (1985) Some remarks on the stable matching problem. Discrete Appl Math 11:223-232
6. Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithms. MIT Press, Cambridge
7. Halldórsson M, Irving RW, Iwama K, Manlove DF, Miyazaki S, Morita Y, Scott S (2003a) Approximability results for stable marriage problems with ties. Theor Comput Sci 306(1-3):431-447
8. Halldórsson M, Iwama K, Miyazaki S, Yanagisawa H (2003b) Improved approximation of the stable marriage problem. In: Proceedings of ESA 2003: the eleventh European symposium on algorithms. Lecture notes in computer science, vol 2832. Springer, Berlin, pp 266-277
9. Halldórsson MM, Iwama K, Miyazaki S, Yanagisawa H (2004) Randomized approximation of the stable marriage problem. Theor Comput Sci 325(3):439-465
10. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J Comput 2:225-231
11. Irving RW (1994) Stable marriage and indifference. Discrete Appl Math 48:261-272
12. Irving RW (1998) Matching medical students to pairs of hospitals: a new variation on a well-known theme. In: Proceedings of ESA '98: the sixth European symposium on algorithms. Lecture notes in computer science, vol 1461. Springer, Berlin, pp 381-392
13. Irving RW, Leather P (1986) The complexity of counting stable marriages. SIAM J Comput 15(3):655-667
14. Irving RW, Manlove DF (2007) An 8/5 approximation algorithm for a hard variant of stable marriage. In: Proceedings of COCOON 2007, 13th annual international computing and combinatorics conference, Banff, Canada. Lecture notes in computer science, vol 4598. Springer, Berlin, pp 548-558
15. Irving RW, Manlove DF, Scott S (2000) The hospitals/residents problem with ties. In: Proceedings of SWAT 2000: the 7th Scandinavian workshop on algorithm theory. Lecture notes in computer science, vol 1851. Springer, Berlin, pp 259-271
16. Irving RW, Manlove DF, Scott S (2003) Strong stability in the hospitals/residents problem. In: Proceedings of STACS 2003: the 20th annual symposium on theoretical aspects of computer science. Lecture notes in computer science, vol 2607. Springer, Berlin, pp 439-450
17. Iwama K, Miyazaki S, Okamoto K (2004) A A (2-c log n/n)-approximation algorithm for the stable marriage problem. In: Proceedings of SWAT 2004: the 9th Scandinavian workshop on algorithm theory. Lecture notes in computer science, vol 3111. Springer, Berlin, pp 349-361
18. Iwama K, Miyazaki S, Yamauchi N (2005) A A (2-c 1/√n)-approximation algorithm for the stable marriage problem. In: Proceedings of ISAAC 2005: the sixteenth international symposium on algorithms and computation. Lecture notes in computer science, vol 3827. Springer, Berlin, pp 902-914
19. Iwama K, Miyazaki S, Yamauchi N (2007) A 1.875-approximation algorithm for the stable marriage problem. In: Proceedings of SODA 2007: the eighteenth ACM/SIAM symposium on discrete algorithms, pp 288-297
20. Manlove DF, Irving RW, Iwama K, Miyazaki S, Morita Y (2002) Hard variants of stable marriage. Theor Comput Sci 276(1-2):261-279
21. National Resident Matching Program website http://www.nrmp.org/ about_nrmp/how.html
22. Roth AE (1984) The evolution of the labor market for medical interns and residents: a case study in game theory. J Political Econ 92(6):991-1016
23. Roth AE, Sotomayor MAO (1990) Two-sided matching: a study in game-theoretic modeling and analysis. Econometric society monographs, vol 18. Cambridge University Press, Cambridge
24. Scottish Foundation Allocation Scheme website http://www.nes.scot.nhs.uk/ sfas/