A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties

The problem of finding a maximum cardinality stable matching in the presence of ties and unacceptable partners, called MAX SMTI, is a well-studied NP-hard problem. The MAX SMTI is NP-hard even for highly restricted instances where (i) ties appear only in women’s preference lists and (ii) each tie appears at the end of each woman’s preference list. The current best lower

• Type: Journal
• Year: 2015
• Where: APPROX
• Authors: Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
• Keywords: Algorithms, APPROX 2015