Rank-Maximal Matchings

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 68-75

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

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBABILITY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

GREEDY MATCHING; HUNGARIAN ALGORITHMS;

COMPUTER SCIENCE;

EID: 1842421192     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. H. N. Gabow and R.E. Tarjaa. Faster scaling algorithms for network problems. SIAM Journal of Computing, 18:1013-1036, 1989.
2. D. Gale and L. S. Shapley. College admissions and the stability of marriage. American Mathematical Monthly, 69:9-15, 1962.
3. R. L. Graham, M. Grötschel, and L. Lovasz, editors. The Handbook of Combinatorics, chapter 3, Matchings and Extensions, pages 179-232, North Holland, 1995.
4. D. Gusfield and R. W. Iiving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, 1989.
5. M. M. Halldórsson, K. Iwama, S. Miyasaki, and H. Yanagisawa. Improved approximation of the stable marriage problem, to appear in ESA 2003.
6. 5/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 2:225-231, 1973.
7. R. W. Irving. Matching medical students to pairs of hospitals: a new variation on a well-known theme. In Proceedings of the Sixth European Symposium on Algorithms, pages 381-392, 1998.
8. R. W. Irving. Greedy matchings. Technical Report TR-2003-136, University of Glasgow, April 2003.
9. R. W. Irving, D. F. Manlove, and S. Scott. Strong stability in the hospitals/residents problem. In Proceedings of the STAGS, pages 439-450, 2003.
10. K. Mehlhorn and S. Naher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
11. J. B. Orlin and R. K. Ahuja. New scaling algorithms for the assignment and minimum cycle problems. Mathematical Programming, 54:41-56, 1992.
12. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization Algorithms and Complexity. Prentice Hall, 1982.
13. A. E. Roth. The evaluation of the labor market for medical interns and residents: a case study in game theory. Journal of Political Economy, 92(6), 1984.