<XML><RECORDS><RECORD><REFERENCE_TYPE>10</REFERENCE_TYPE><REFNUM>8713</REFNUM><AUTHORS><AUTHOR>Irving,R.W.</AUTHOR><AUTHOR>Manlove,D.F.</AUTHOR></AUTHORS><YEAR>2007</YEAR><TITLE>Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems</TITLE><PLACE_PUBLISHED>DCS Technical Report Series</PLACE_PUBLISHED><PUBLISHER>Dept of Computing Science, University of Glasgow</PUBLISHER><ISBN>TR-2007-258</ISBN><LABEL>Irving:2007:8713</LABEL><KEYWORDS><KEYWORD>Stable marriage problem; Hospitals / Residents problem; ties; NP-hardness; approximation algorithm</KEYWORD></KEYWORDS<ABSTRACT>When ties and incomplete preference lists are permitted in the Stable Marriage and Hospitals/Residents problems, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is known to be NP-hard, even under very severe restrictions on the number, size and position of ties. In this paper, we describe polynomial-time 5/3-approximation algorithms for variants of these problems in which ties are on one side only and at the end of the preference lists. The particular variant is motivated by important applications in large scale centralised matching schemes.</ABSTRACT></RECORD></RECORDS></XML>