Improved approximation bounds for the Student-Project Allocation problem with preferences over projects

Journal of Discrete Algorithms - Tập 13 - Trang 59-66 - 2012
Kazuo Iwama1, Shuichi Miyazaki2, Hiroki Yanagisawa3
1Graduate School of Informatics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto-shi, Kyoto 606-8501, Japan
2Academic Center for Computing and Media Studies, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto-shi, Kyoto 606-8501, Japan
3IBM Research – Tokyo, 1623-14 Shimotsuruma, Yamato-shi, Kanagawa 242-8502, Japan

Tài liệu tham khảo

Abraham, 2007, Two algorithms for the Student-Project Allocation problem, Journal of Discrete Algorithms, 5, 73, 10.1016/j.jda.2006.03.006 Gale, 1962, College admissions and the stability of marriage, American Mathematical Monthly, 69, 9, 10.2307/2312726 Gusfield, 1989 Halldórsson, 2007, Improved approximation results for the stable marriage problem, ACM Transactions on Algorithms, 3, 9, 10.1145/1273340.1273346 Iwama, 2010, A 25/17-approximation algorithm for the stable marriage problem with one-sided ties, vol. 6347, 135 Khot, 2008, Vertex cover might be hard to approximate to within 2−ϵ, Journal of Computer and System Sciences, 74, 335, 10.1016/j.jcss.2007.06.019 Király, 2011, Better and simpler approximation algorithms for the stable marriage problem, Algorithmica, 60, 3, 10.1007/s00453-009-9371-7 Manlove, 2008, Student-Project Allocation with preferences over projects, Journal of Discrete Algorithms, 6, 553, 10.1016/j.jda.2008.07.003