A 1.875-approximation algorithm for the stable marriage problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 288-297

  Iwama, Kazuo ^a   Miyazaki, Shuichi ^b   Yamauchi, Naoya ^a  

^a KYOTO UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

A-STABLE; APPROXIMATION RATIOS; POSITIVE CONSTANT; PREFERENCE LISTS; STABLE MARRIAGE PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 84969218955     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. D. J. Abraham, K. Cechlárová, D. F. Manlove and K. Mehlhorn, "Pareto optimality in house allocation problems," Proc. ISAAC 2004, LNCS 3341, pp. 3-15, 2004.
2. D. J. Abraham, R. W. Irving, T. Kavitha and K. Mehlhorn, "Popular matchings," Proc. SODA 2005, pp. 424-432, 2005.
3. V. Bansal, A. Agrawal and V. Malhotra, "Stable marriages with multiple partners: efficient search for an optimal solution," Proc. ICALP 2003, LNCS 2719, pp. 527-542, 2003.
4. R. Bar-Yehuda and S. Even, "A local-ratio theorem for approximating the weighted vertex cover problem," In Analysis and Design of Algorithms for Combinatorial Problems, volume 25 of Annals of Disc. Math., Elsevier Science Publishing Company, Amsterdam, pp. 27-46, 1985.
5. P. Berman and T. Fujito, "On the approximation properties of independent set problem in degree 3 graphs," Proc. WADS 95, LNCS 955, pp. 449-460, 1995.
6. Canadian Resident Matching Service (CaRMS), http://www.carms.ca/
7. K. Cechlárová, "On the complexity of exchange-stable roommates," Discrete Applied Mathematics, Vol. 116, pp. 279-287, 2002.
8. T. Fleiner, "A fixed-point approach to stable matchings and some applications," Mathematics of Operations Research, Vol. 28, Issue 1, pp. 103-126, 2003.
9. D. Gale and L. S. Shapley, "College admissions and the stability of marriage," Amer. Math. Monthly, Vol. 69, pp. 9-15, 1962.
10. D. Gale and M. Sotomayor, "Some remarks on the stable matching problem," Discrete Applied Mathematics, Vol. 11, pp. 223-232, 1985.
11. D. Gusfield and R. Irving, "The Stable Marriage Problem: Structure and Algorithms," MIT Press, Boston, MA, 1989.
12. M. M. Halldórsson, R. Irving, K. Iwama, D. Manlove, S. Miyazaki, Y. Morita and S. Scott, "Approximability results for stable marriage problems with ties," Theoretical Computer Science, Vol. 306, pp. 431-447, 2003.
13. M. M. Halldórsson, K. Iwama, S. Miyazaki and H. Yanagisawa, "Randomized approximation of the stable marriage problem," Theoretical Computer Science, Vol. 325, No. 3, pp. 439-465, 2004.
14. M. M. Halldórsson, K. Iwama, S. Miyazaki and H. Yanagisawa, "Improved approximation of the stable marriage problem," Proc. ESA 2003, LNCS 2832, pp. 266-277, 2003.
15. E. Halperin, "Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs," Proc. SODA 2000, pp. 329-337, 2000.
16. R. Irving, "Stable marriage and indifference," Discrete Applied Mathematics, Vol. 48, pp. 261-272, 1994.
17. Kavitha R. Irving, "Matching medical students to pairs of hospitals: a new variation on an old theme," Proc. ESA 98, LNCS 1461, pp. 381-392, 1998.
18. R. W. Irving, D. F. Manlove and S. Scott, "The hospital/residents problem with ties," Proc. SWAT 2000, LNCS 1851, pp. 259-271, 2000.
19. R. Irving, T. K. Mehlhorn, D. Michail, and K. Paluch, "Rank-maximal matchings," Proc. SODA 2004, pp. 68-75, 2004.
20. R.W. Irving, D.F. Manlove, S. Scott, "Strong stability in the hospitals/residents problem," Proc. STACS 2003, LNCS 2607, pp. 439-450, 2003.
21. K. Iwama, D. F. Manlove, S. Miyazaki, and Y. Morita, "Stable marriage with incomplete lists and ties," Proc. ICALP 99, LNCS 1644, pp. 443-452, 1999.
22. K. Iwama, S. Miyazaki and K. Okamoto, "A (2 - c log N/N)-approximation algorithm for the stable marriage problem, Proc. SWAT 2004, LNCS 3111, pp. 349-361, 2004.
23. K. Iwama, S. Miyazaki, N. Yamauchi, "A (2 - C 1/√N)- Approximation Algorithm for the Stable Marriage Problem," Proc, ISAAC 2005, LNCS 3827, pp. 902-914, 2005.
24. Japanese Resident Matching Program (JRMP), http://www.jrmp.jp/
25. G. Karakostas, "A better approximation ratio for the Vertex Cover problem," ECCC Report, TR04-084, 2004.
26. M. Karpinski, "Polynomial time approximation schemes for some dense instances of NP-hard optimization problems," Proc. RANDOM 97, LNCS 1269, pp. 1-14, 1997.
27. T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch, "Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem," Proc. STACS 2004, pp. 222-233, 2004.
28. T. Le, V. Bhushan, and C. Amin, "First aid for the match, second edition," McGraw-Hill, Medical Publishing Division, 2001.
29. D. F. Manlove, R. W. Irving, K. Iwama, S. Miyazaki, Y. Morita, "Hard variants of stable marriage," Theoretical Computer Science, Vol. 276, Issue 1-2, pp. 261-279, 2002.
30. B. Monien and E. Speckenmeyer, "Ramsey numbers and an approximation algorithm for the vertex cover problem," Acta Inf., Vol. 22, pp. 115-123, 1985.
31. H. Nagamochi, Y. Nishida and T. Ibaraki, "Approximability of the minimum maximal matching problem in planar graphs," Institute of Electronics, Information and Communication Engineering, Transactions on Fundamentals, vol.E86-A, pp. 3251-3258, 2003.
32. C.P. Teo, J.V. Sethuraman and W.P. Tan, "Gale-Shapley stable marriage problem revisited: Strategic issues and applications," Proc. IPCO 99, pp. 429-438, 1999.
33. M. Zito, "Randomized techniques in combinatorial algorithmics," PhD thesis, Dept. of Computer Science, University of Warwick, 1999.