Improved approximation of the stable marriage problem

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

Volumn 2832, Issue , 2003, Pages 266-277

  Halldórsson, Magnús M ^a   Iwama, Kazuo ^b   Miyazaki, Shuichi ^c   Yanagisawa, Hiroki ^b  

^a UNIVERSITY OF ICELAND   (Iceland)

^b KYOTO UNIVERSITY   (Japan)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY;

A-STABLE; APPROXIMATION RATIOS; LOWER BOUNDS; MAXIMAL MATCHINGS; NP-HARD; STABLE MARRIAGE PROBLEM; STABLE MATCHING;

APPROXIMATION ALGORITHMS;

EID: 0142183800     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_26     Document Type: Article

References (20)

1. V. Bansal, A. Agrawal and V. Malhotra, "Stable marriages with multiple partners: efficient search for an optimal solution," In Proc. ICALP 2003, to appear.
2. R. P. Dilworth, "A Decomposition Theorem for Partially Ordered Sets," Ann. Math. Vol. 51, pp. 161-166, 1950.
3. I. Dinur and S. Safra, "The importance of being biased," In Proc. of 34th STOC, pp. 33-42, 2002.
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. W. Irving, "The Stable Marriage Problem: Structure and Algorithms," MIT Press, Boston, MA, 1989.
7. M. Halldórsson, R.W. Irwing, K. Iwama, D.F. Manlove, S. Miyazaki, Y. Morita, and S. Scott, "Approximability Results for Stable Marriage Problems with Ties", Theoretical Computer Science, to appear.
8. M. Halldórsson, K. Iwama, S. Miyazaki, and Y. Morita, "Inapproximability results on stable marriage problems," In Proc. LATIN 2002, LNCS 2286, pp. 554-568, 2002.
9. M. Halldórsson, K. Iwama, S. Miyazaki, and H. Yanagisawa, "Randomized approximation of the stable marriage problem," In Proc. COCOON 2003, to appear.
10. E. Halperin, "Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs," In Proc. 11th SODA, pp. 329-337, 2000.
11. R. W. Irving, "Stable marriage and indifference," Discrete Applied Mathematics, Vol. 48, pp. 261-272, 1994.
12. R. W. Irving, "Matching medical students to pairs of hospitals: a new variation on an old theme," In Proc. ESA 98, LNCS 1461, pp. 381-392, 1998.
13. R.W. Irving, D.F. Manlove, S. Scott, "Strong Stability in the Hospitals/Residents Problem," In Proc. STACS 2003, LNCS 2607, pp. 439-450, 2003.
14. K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita, "Stable marriage with incomplete lists and ties," In Proc. ICALP 99, LNCS 1644, pp. 443-452, 1999.
15. D. Manlove, R. W. Irving, K. Iwama, S. Miyazaki, and Y. Morita, "Hard variants of stable marriage," Theoretical Computer Science, Vol. 276, Issue 1-2, pp. 261-279, 2002.
16. B. Monien and E. Speckenmeyer, "Ramsey numbers and an approximation algorithm for the vertex cover problem," Acta Inf., Vol. 22, pp. 115-123, 1985.
17. G. L. Nemhauser and L. E. Trotter, "Vertex packing: structural properties and algorithms", Mathematical Programming, Vol. 8, pp. 232-248, 1975.
18. C.P. Teo, J.V. Sethuraman and W.P. Tan, "Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications," In Proc. IPCO 99, pp. 429-438, 1999.
19. M. Yannakakis and F. Gavril, "Edge dominating sets in graphs," SIAM J. Appl. Math., Vol. 38, pp. 364-372, 1980.
20. M. Zito, "Small maximal matchings in random graphs," Proc. LATIN 2000, LNCS 1776, pp. 18-27, 2000.