Funder
Magyar Tudományos Akadémia
Nemzeti Kutatási és Technológiai Hivatal
Engineering and Physical Sciences Research Council
European Cooperation in Science and Technology
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference26 articles.
1. Abraham, D J., Biró, P., Manlove, D.F.: “Almost stable” matchings in the roommates problem. In: Proceedings of WAOA ’05, vol. 3879 of Lecture Notes in Computer Science, pp 1–14. Springer, Berlin (2006)
2. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. ECCC report, no. 49 (2003)
3. Biró P., Manlove, D.F., McBride, I.: The Hospitals / Residents problem with couples: Complexity and integer programming models. In: Proceedings of SEA ’14, vol. 8504 of Lecture Notes in Computer Science, pp 10–21. Springer, Berlin (2014)
4. Biró, P., Manlove, D.F., McDermid, E.J: “Almost stable” matchings in the roommates problem with bounded preference lists. Theor. Comput. Sci. 432, 10–20 (2012)
5. Biró, P., Manlove, D.F., Mittal, S.: Size versus stability in the marriage problem. Theor. Comput. Sci. 411, 1828–1841 (2010)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献