Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems

@article{Irving2008ApproximationAF,
  title={Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems},
  author={Robert W. Irving and David Manlove},
  journal={J. Comb. Optim.},
  year={2008},
  volume={16},
  pages={279-292}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
15 Citations
22 References
Similar Papers

Similar Papers

Loading similar papers…