Better and Simpler Approximation Algorithms for the Stable Marriage Problem
We first consider the problem of finding a maximum stable matching if incomplete lists and ties are both allowed, but ties only for one gender. For this problem we give a simple, linear time 3/2-approximation algorithm, improving on the best known approximation factor 5/3 of Irving and Manlove . Next, we show how this extends to the Hospitals/Residents problem with the same ratio if the residents have strict orders. We also give a simple linear time algorithm for the general problem with approximation factor 5/3, improving the best known 15/8-approximation algorithm of Iwama, Miyazaki and Yamauchi . For the cases considered in this paper it is NP-hard to approximate within a factor of 21/19 by the result of Halldórsson et al. .
Our algorithms not only give better approximation ratios than the cited ones, but are much simpler and run significantly faster. Also we may drop a restriction used in  and the analysis is substantially more moderate.
Keywordsstable matching Hospitals/Residents problem approximation algorithms
Unable to display preview. Download preview PDF.
- 3.Halldórsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. ACM Trans. Algorithms, Article 30 3(3) (2007)Google Scholar
- 5.Irving, R.W., Manlove, D.F.: Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems. Journal of Combinatorial Optimization (2007), doi:10.1007/s10878-007-9133-xGoogle Scholar
- 7.Iwama, K., Miyazaki, S., Yamauchi, N.: A 1.875-approximation algorithm for the stable marriage problem. In: SODA 2007: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 288–297 (2007)Google Scholar