Stable marriage with incomplete lists and ties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 443-452

  Iwama, Kazuo ^a   Manlove, David ^b   Miyazaki, Shuichi ^a   Morita, Yasufumi ^a  

^a KYOTO UNIVERSITY   (Japan)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; NP-HARD; OPTIMAL COSTS; POLYNOMIAL-TIME; PREFERENCE LISTS; RELAXED PROBLEM; STABLE MARRIAGE PROBLEM; STABLE MARRIAGES;

APPROXIMATION ALGORITHMS;

EID: 84887418963     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_41     Document Type: Conference Paper

References (9)

1. D. Gale and L. S. Shapley, "College admissions and the stability of marriage, " Amer. Math. Monthly, Vol.69, pp.9-15, 1962.
2. D. Gale and M. Sotomayor, "Some remarks on the stable matching problem, " Discrete Applied Mathematics, Vol.11, pp.223-232, 1985.
3. M. R. Garey and D. S. Johnson, "Computers and Intractability, A Guide to The Theory of NP-Completeness, " Freeman, San Francisco, 1979.
4. D. Gusfield and R. W. Irving, "The Stable Marriage Problem: Structure and Algorithms, " MIT Press, Boston, MA, 1989.
5. J. Håstad, "Clique is hard to approximate within n1-, " Proc. FOCS96, pp.627{636, 1996.
6. R. W. Irving, "Stable marriage and indifference, " Discrete Applied Mathematics, Vol.48, pp.261-272, 1994.
7. T. Ohguro, "On the hardness of approximating minimization problems: in comparison with maximization classes, " Technical Report of IEICE, COMP94-112 pp.89-96, 1995.
8. E. Ronn, "NP-complete stable matching problems, " J. Algorithms, Vol.11, pp.285-304, 1990.
9. M. Yannakakis and F. Gavril, "Edge dominating sets in graphs, " SIAM J. Applied Mathematics, Vol.18, No.1, pp.364{372, 1980.