A (2 - C log N/N)-approximation algorithm for the stable marriage problem

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

Volumn 3111, Issue , 2004, Pages 349-361

  Iwama, Kazuo ^a   Miyazaki, Shuichi ^b   Okamoto, Kazuya ^a  

^a KYOTO UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

APPROXIMATION RATIOS; POSITIVE CONSTANT; PREFERENCE LISTS; STABLE MARRIAGE PROBLEM; STABLE MATCHING;

APPROXIMATION ALGORITHMS;

EID: 35048874842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_30     Document Type: Article

References (21)

1. 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.
2. 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.
3. T. Elde, "Assignment engine," Senior Honours Project Report, Department of Computing Science, University of Glasgow, 2000.
4. D. Gale and L. S. Shapley, "College admissions and the stability of marriage," Amer. Math. Monthly, Vol. 69, pp. 9-15, 1962.
5. D. Gale and M. Sotomayor, "Some remarks on the stable matching problem," Discrete Applied Mathematics, Vol. 11, pp. 223-232, 1985.
6. D. Gusfield and R. Irving, "The Stable Marriage Problem: Structure and Algorithms," MIT Press, Boston, MA, 1989.
7. 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.
8. M. Halldórsson, K. Iwama, S. Miyazaki and H. Yanagisawa, "Randomized approximation of the stable marriage problem," Proc. COCOON 2003, LNCS 2697, pp. 339-350, 2003.
9. 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.
10. E. Halperin, "Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs," Proc. SODA 2000, pp. 329-337, 2000.
11. R. Irving, "Stable marriage and indifference," Discrete Applied Mathematics, Vol. 48, pp. 261-272, 1994.
12. 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.
13. R. Irving, D. Manlove and S. Scott, "The hospital/residents problem with ties," Proc. SWAT 2000, LNCS 1851, pp. 259-271, 2000.
14. K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita, "Stable marriage with incomplete lists and ties," Proc. ICALP 99, LNCS 1644, pp. 443-452, 1999.
15. M. Karpinski, "Polynomial time approximation schemes for some dense instances of NP-hard optimization problems," Proc. RANDOM 97, LNCS 1269, pp. 1-14, 1997.
16. T. Le, V. Bhushan, and C. Amin, "First aid for the match, second edition," McGraw-Hill, Medical Publishing Division, 2001.
17. D. Manlove, R. Irving, K. Iwama, S. Miyazaki, Y. Morita, "Hard variants of stable marriage," Theoretical Computer Science, Vol. 276, Issue 1-2, pp. 261-279, 2002.
18. B. Monien and E. Speckenmeyer, "Ramsey numbers and an approximation algorithm for the vertex cover problem," Acta Inf., Vol. 22, pp. 115-123, 1985.
19. 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.
20. 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.
21. M. Zito, "Randomized techniques in combinatorial algorithmics," PhD thesis, Dept. of Computer Science, University of Warwick, 1999.