Abstract
We consider the problem of finding a stable matching of maximum size when both ties and unacceptable partners are allowed in preference lists. This problem is NP-hard and the current best known approximation algorithm achieves the approximation ratio 2 -clogN/N, where c is an arbitrary positive constant and N is the number of men in an input. In this paper, we improve the ratio to 2 - c1/√N, where c is a constant such that c ≤ 1/4√6. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Iwama, K., Miyazaki, S., & Yamauchi, N. (2005). A (2 - c1/√N)-approximation algorithm for the stable marriage problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3827 LNCS, pp. 902–914). https://doi.org/10.1007/11602613_90
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
