A 3/2-approximation algorithm for general stable marriage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 689-700

  McDermid, Eric ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; DIFFERENT SIZES; GENERAL VERSION; MATCHING SCHEME; MATCHINGS; MEDICAL STUDENTS; PERFORMANCE GUARANTEES; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; PREFERENCE LISTS; STABLE MARRIAGE PROBLEM; STABLE MARRIAGES; STABLE MATCHING;

LINGUISTICS; POLYNOMIAL APPROXIMATION; TRANSLATION (LANGUAGES);

APPROXIMATION ALGORITHMS;

EID: 70449095257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_57     Document Type: Conference Paper

References (20)

1. Biró, P.: Student Admissions in Hungary as Gale and Shapley Envisaged. University of Glasgow, Computing Science Department Research Report, TR-2008-291 (2008)
2. Gale, D., Shapley, L.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9-15 (1962)
3. Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Applied Mathematics 11, 223-232 (1985)
4. Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)
5. Halldórsson, M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. ACM Trans. Algorithms 3(3), 30 (2007)
6. Halldórsson, M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Randomized approximation of the stable marriage problem. Theoretical Computer Science 325(3), 439-465 (2004)
7. Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM Journal on Computing 15(3), 655-667 (1986)
8. Irving, R.W., Manlove, D.F.: Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems. Journal of Combinatorial Optimization 16, 279-292 (2008)
9. Iwama, K., Miyazaki, S., Okamoto, K.: A (2 - c log n/n)- approximation algorithm for the stable marriage problem. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 349-361. Springer, Heidelberg (2004)
10. Iwama, K., Miyazaki, S., Yamauchi, N.: A (2 - c(1/√ (N)))-Approximation Algorithm for the Stable Marriage Problem. Algorithmica 51(3), 342-356 (2008)
11. Iwama, K., Miyazaki, S., Yamauchi, N.: A 1.875-approximation algorithm for the stable marriage problem. In: 18th ACM/SIAM Symposium on Discrete Algorithms, pp. 288-297 (2007)
12. Király, Z.: Better and simpler approximation algorithms for the stable marriage problem. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 623-634. Springer, Heidelberg (2008)
13. Knuth, D.E.: Manages Stables. Les Presses de L'Université de Montréal (1976)
14. Lovász, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, vol. 29. North-Holland, Amsterdam (1986)
15. Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science 276(1-2), 261-279 (2002)
16. Canadian Resident Matching Service, http://www.carms.ca/jsp/main.jsp
17. National Resident Matching Program, http://www.nrmp.org/about-nrmp/how. html
18. Scottish Foundation Allocation Scheme, http://www.nes.scot.nhs.uk/sfas/
19. Yanagisawa, H.: Approximation algorithms for stable marriage problems, PhD thesis, Kyoto University, Graduate School of Informatics (2007)
20. Yanagisawa, H.: Personal communication (2008)