Abstract
We propose an approximation algorithm for the problem of finding a maximum stable matching when both ties and unacceptable partners are allowed in preference lists. Our algorithm achieves the approximation ratio \(2 - c\frac{{\rm log} N}{N}\) for an arbitrarily positive constant c, where N denotes the number of men in an input. This improves the trivial approximation ratio of two.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. In: Analysis and Design of Algorithms for Combinatorial Problems, Annals of Disc. Math., vol. 25, pp. 27–46. Elsevier Science Publishing Company, Amsterdam (1985)
Berman, P., Fujito, T.: On the approximation properties of independent set problem in degree 3 graphs. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 449–460. Springer, Heidelberg (1995)
Elde, T.: Assignment engine. Senior Honours Project Report, Department of Computing Science, University of Glasgow (2000)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Monthly 69, 9–15 (1962)
Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Applied Mathematics 11, 223–232 (1985)
Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston (1989)
Halldórsson, M., Irving, R., Iwama, K., Manlove, D., Miyazaki, S., Morita, Y., Scott, S.: Approximability results for stable marriage problems with ties. Theoretical Computer Science 306, 431–447 (2003)
Halldórsson, M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Randomized approximation of the stable marriage problem. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 339–350. Springer, Heidelberg (2003)
Halldórsson, M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation of the stable marriage problem. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 266–277. Springer, Heidelberg (2003)
Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In: Proc. SODA 2000, pp. 329–337 (2000)
Irving, R.: Stable marriage and indifference. Discrete Applied Mathematics 48, 261–272 (1994)
Irving, R.: Matching medical students to pairs of hospitals: a new variation on an old theme. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 381–392. Springer, Heidelberg (1998)
Irving, R., Manlove, D., Scott, S.: The hospitals/Residents problem with ties. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 259–271. Springer, Heidelberg (2000)
Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 443–452. Springer, Heidelberg (1999)
Karpinski, M.: Polynomial time approximation schemes for some dense instances of NP-hard optimization problems. In: Rolim, J.D.P. (ed.) RANDOM 1997. LNCS, vol. 1269, pp. 1–14. Springer, Heidelberg (1997) ,A (2 − c N )–Approximation Algorithm for the Stable Marriage Problem 361
Le, T., Bhushan, V., Amin, C.: First aid for the match, 2nd edn. McGraw-Hill, Medical Publishing Division (2001)
Manlove, D., Irving, R., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science 276(1-2), 261–279 (2002)
Monien, B., Speckenmeyer, E.: Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inf. 22, 115–123 (1985)
Nagamochi, H., Nishida, Y., Ibaraki, T.: Approximability of the minimum maximal matching problem in planar graphs. Institute of Electronics, Information and Communication Engineering, Transactions on Fundamentals E86-A, 3251–3258 (2003)
Teo, C.P., Sethuraman, J.V., Tan, W.P.: Gale-shapley stable marriage problem revisited: Strategic issues and applications. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 429–438. Springer, Heidelberg (1999)
Zito, M.: Randomized techniques in combinatorial algorithmics. PhD thesis, Dept. of Computer Science, University of Warwick (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwama, K., Miyazaki, S., Okamoto, K. (2004). A (\(2 - c\frac{{\rm log} N}{N}\))–Approximation Algorithm for the Stable Marriage Problem. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive