Improved approximation results for the stable marriage problem

ACM Transactions on Algorithms

Volumn 3, Issue 3, 2007, Pages

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

^a UNIVERSITY OF ICELAND   (Iceland)

^b KYOTO UNIVERSITY   (Japan)

^c IBM RESEARCH TOKYO   (Japan)

^d KYOTO UNIVERSITY   (Japan)

Author keywords

Approximation algorithms; Incomplete lists; Stable marriage problem; Ties

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTATIONAL COMPLEXITY; NUMERICAL METHODS; PATTERN MATCHING; PROBLEM SOLVING;

APPROXIMATION RATIO; INCOMPLETE LISTS; STABLE MARRIAGE PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 34548286312     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1273340.1273346     Document Type: Article

References (29)

1. ABRAHAM, D. J., IRVING, R. W., AND MANLOVE, D. F. 2003. The student-project allocation problem. In Proceedings of the 14th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 2906. Springer, 474-484.
2. BANSAL, V., AGRAWAL, A., AND MALHOTRA, V. 2003. Stable marriages with multiple partners: Efficient search for an optimal solution. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 2719. Springer, 527-542.
3. BAR-YEHUDA, R., AND EVEN, S. 1985. A local-ratio theorem for approximating the weighted vertex cover problem.. Ann. Discrete Math. 25, 27-46.
4. BERMAN, P., AND FUJITO, T. 1995. On the approximation properties of independent set problem in degree 3 graphs. In Proceedings of the 4th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 955. Springer, 449-460.
5. ECHLÁROVÁ, K. 2002. On the complexity of exchange-stable roommates. Discrete Appl. Math. 116, 279-287.
6. ILWORTH, R. P. 1950. A decomposition, theorem for partially ordered sets. Ann. Math. 51, 161-166.
7. INUR, I., AND SAFRA, S. 2002. The importance of being biased. In Proceedings of the 34th Symposium on Theory of Computing. 33-42.
8. FLEINER, T. 2003. A fixed-point approach to stable matchings and some applications. Math. Oper. Res. 28, 1, 103-126.
9. GALE, D., AND SHAPLEY, L. S. 1962. College admissions and the stability of marriage. Amer. Math. Monthly 69, 9-15.
10. GALE, D., AND SOTOMAYOR, M. 1985. Some remarks on the stable matching problem. Discrete Appl. Math. 11, 223-232.
11. GUSfiELD, D., AND IRVING, R. W. 1989. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston, MA.
12. HALLDÓRSSON, M. M., IWAMA, K., MIYAZAKI, S., AND YANAGISAWA, H. 2004. Randomized approximation of the stable marriage problem. Theor. Comput. Sci. 325, 439-465.
13. HALLDÓRSSON, M. M., IRVING, R. W., IWAMA, K., MANLOVE, D. F., MIYAZAKI, S., MORITA, Y., AND SCOTT, S. 2003a. Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306, 431-447.
14. HALLDÓRSSON, M. M., IWAMA, K., MIYAZAKI, S., AND YANAGISAWA, H. 2003b. Improved approximation of the stable marriage problem. In Proceedings of the 11th European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 2832. Springer, 266-277.
15. HALPERIN, E. 2000. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In Proceedings of the 11th Symposium on Discrete Algorithms. 329-337.
16. RVING, R. W. 1998. Matching medical students to pairs of hospitals: A new variation on a well-known theme. In Proceedings of the 6th European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 1461. Springer, 381-392.
17. RVING, R. W. 1994. Stable marriage and indifference. Discrete Appl. Math. 48, 261-272.
18. RVING, R. W., MANLOVE, D. F., AND SCOTT, S. 2003. Strong stability in the hospitals/residents problem. In Proceedings of the 20th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 2607. Springer, 439-450.
19. WAMA, K., MIYAZAKI, S., AND YAMAUCHI, N. 2005. A (2 - c 1/√n-approximation algorithm for the stable marriage problem. In Proceedings of the 16th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 3827. Springer, 902-914.
20. WAMA, K., MANLOVE, D. F., MIYAZAKI, S., AND MORITA, Y. 1999. Stable marriage with incomplete lists and ties. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 1644. Springer, 443-452.
21. KARAKOSTAS, G. 2004. A better approximation ratio for the vertex cover problem. Tech. Rep. TR04-084, ECCC Report.
22. KARPINSKI, M. 1997. Polynomial time approximation schemes for some dense instances of NP-hard optimization problems. In Proceedings of the 1st Symposium on Workshop Randomization and Approximation Techniques in Computer Science. Lecture Notes in Computer Science, vol. 1269. Springer, 1-14.
23. KAVITHA, T., MEHLHORN, K., MICHAIL, D., AND PALUCH, K. 2004. Strongly stable matchings in time 0(nm) and extension to the H/R problem. In Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science. 222-233.
24. ANLOVE, D. F., IRVING, R. W., IWAMA, K., MIYAZAKI, S., AND MORITA, Y 2002. Hard variants of stable marriage. Theor. Comput. Sci. 276, 261-279.
25. ONIEN, B., AND SPECKENMEYER, E. 1985. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inf. 22, 115-123.
26. NAGAMOCHI, H., NISHIDA, Y., AND IBARAKI, T. 2003. Approximability of the minimum maximal matching problem in planar graphs. Inst. Electron. Inf. Commun. Eng., Trans. Fundam. E86-A, 3251-3258.
27. NEMHAUSER, G. L., AND TROTTER, L. E. 1975. Vertex packing: Structural properties and algorithms. Math. Program. 8, 232-248.
28. TEO, C. P., SETHURAMAN, J. V., AND TAN, W. P. 1999. Gale-shapley stable marriage problem revisited: Strategic issues and applications. In Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 1610. Springer, 429-438.
29. ZITO, M. 1999. Randomized techniques in combinatorial, algorithmics. Ph.D. thesis, Department of Computer Science, University of Warwick.