Author:
Dean Brian C.,Swar Namrata
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Baiou, M., Balinski, M.: Many-to-many matching: Stable polyandrous polygamy (or polygamous polyandry). Discrete Applied Mathematics 101, 1–12 (2000)
2. Baiou, M., Balinski, M.: Erratum: The stable allocation (or ordinal transportation) problem. Mathematics of Operations Research 27(4), 662–680 (2002)
3. Lecture Notes in Computer Science;B.C. Dean,2006
4. Dean, B.C., Immorlica, N., Goemans, M.X.: The unsplittable stable marriage problem. In: Proceedings of the 4th IFIP International Conference on Theoretical Computer Science (2006)
5. Dean, B.C., Munshi, S.: Faster algorithms for stable allocation problems. In: Proceedings of the 1st MATCH-UP (Matching Under Preferences) Workshop, pp. 133–144 (2008)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献