메뉴 건너뛰기




Volumn 276, Issue 1-2, 2002, Pages 261-279

Hard variants of stable marriage

Author keywords

Approximation algorithms; Indifference; NP completeness; Stable marriage problem; Ties

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SCIENCE; SET THEORY;

EID: 0037029336     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00206-7     Document Type: Article
Times cited : (262)

References (23)
  • 11
    • 84896778569 scopus 로고    scopus 로고
    • Matching medical students to pairs of hospitals: A new variation on an old theme
    • Proc. ESA '98: the 6th European Symp. on Algorithms, Springer, Berlin
    • (1998) Lecture Notes in Computer Science , vol.1461 , pp. 381-392
    • Irving, R.W.1
  • 15
    • 0003201317 scopus 로고    scopus 로고
    • Stable marriage and its relation to other combinatorial problems
    • American Mathematical Society, Providence, RI, (English translation of Marriages Stables, Les Presses de L'Université de Montréal, 1976)
    • (1997) CRM Proceedings and Lecture Notes , vol.10
    • Knuth, D.E.1
  • 20
    • 84936379779 scopus 로고
    • The evolution of the labor market for medical interns and residents: A case study in game theory
    • (1984) J. Political Economy , vol.92 , Issue.6 , pp. 991-1016
    • Roth, A.E.1
  • 21
    • 0000464910 scopus 로고
    • On the allocation of residents to rural hospitals: A general property of two-sided matching markets
    • (1986) Econometrica , vol.54 , pp. 425-427
    • Roth, A.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.