Rank-maximal matchings

ACM Transactions on Algorithms

Volumn 2, Issue 4, 2006, Pages 602-610

  Irving, Robert W ^a   Kavitha, Telikepalli ^b   Mehlhorn, Kurt ^c   Michail, Dimitrios ^c   Paluch, Katarzyna E ^d  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b INDIAN INSTITUTE OF SCIENCE   (India)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d UNIVERSITY OF WROC AW   (Poland)

Author keywords

Bipartite matching; Maximum cardinality matching; One sided preference lists

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

BIPARTITE MATCHING; MAXIMUM CARDINALITY MATCHING; PREFERENCE LISTS; RANK-MAXIMAL MATCHINGS;

SET THEORY;

EID: 33846620479     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1198513.1198520     Document Type: Conference Paper

References (11)

1. GABOW, H. N., AND TARJAN, R. E. 1989. Faster scaling algorithms for network problems. SIAM J. Comput., 18, 1013-1036.
2. GALE, D., AND SHAPLEY, L. S. 1962. College admissions and the stability of marriage. Amer. Math. Monthly, 69, 9-15.
3. GUSFIELD, D., AND IRVING, R. W. 1989. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA.
4. HALLDÓRSSON, M. M., IWAMA, K., MIYASAKI, S., AND YANAGISAWA, H. 2003. Improved approximation of the stable marriage problem. In Proceedings of the 11th European Symposium on Algorithms 2003, Lecture Notes in Computer Science, vol. 2832, Springer-Verlag, New York, 266-277.
5. 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2, 225-231.
6. RVING, R. W. 1998. Matching medical students to pairs of hospitals: A new variation on a well-known theme. In Proceedings of the 6th European Symposium on Algorithms 1998. Lecture Notes in Computer Science, vol. 1461. Springer-Verlag, New York, 381-392.
7. RVING, R. W. 2003. Greedy matchings. Tech. Rep. TR-2003-136. University of Glasgow, Glasgow, UK, Apr.
8. RVING, R. W., MANLOVE, D. F., AND SCOTT, S. 2003. Strong stability in the hospitals-residents problem. In Proceedings of the 20th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 2607. Springer-Verlag, New York. 439-450.
9. EHLHORN, K., AND MICHAIL, D. Network problems with non-polynomial weights and applications. www.mpi-sb.mpg.de/~mehlhorn/ftp/ HugeWeights.ps
10. PULLEYBLANK, W. R. 1995. Matchings and extensions, In The Handbook of Combinatorics, R. L., Graham, M., Grötschel, and L., Lovász, Eds. North Holland, Amsterdan, The Netherland, 179-232.
11. ROTH, A. E. 1984. The evaluation of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92, 6, 991-1016.