Algorithms | |
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists |
|
Takao Inoshita1  Robert W. Irving2  Kazuo Iwama1  Shuichi Miyazaki3  | |
[1] Graduate School of Informatics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501, Japan; E-Mails:;School of Computing Science, University of Glasgow, Glasgow, G12 8QQ, Scotland; E-Mail:;Academic Center for Computing and Media Studies, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501, Japan | |
关键词: combinatorial optimization; polynomial-time algorithms; stable marriage problem; man-optimal stable matching; | |
DOI : 10.3390/a6020371 | |
来源: mdpi | |
【 摘 要 】
In the stable marriage problem, any instance admits the so-called
【 授权许可】
CC BY
© 2013 by the authors; licensee MDPI, Basel, Switzerland.
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO202003190036170ZK.pdf | 152KB | download |