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 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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Iwama, K., Miyazaki, S., & Okamoto, K. (2004). A (2 - C log N/N)-approximation algorithm for the stable marriage problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3111, 349–361. https://doi.org/10.1007/978-3-540-27810-8_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
