Approximation Algorithms for the Sex-Equal Stable Marriage Problem
From MaRDI portal
Publication:3603527
Recommendations
Cited in
(18)- Complexity of the sex-equal stable marriage problem
- Faster and simpler approximation of stable matchings
- Linear time local approximation algorithm for maximum stable marriage
- Maximum stable matching with one-sided ties of bounded length
- Better and simpler approximation algorithms for the stable marriage problem
- Parametric stable marriage and minimum cuts
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- Progress in Cryptology - INDOCRYPT 2004
- Approximation algorithms for the sex-equal stable marriage problem
- Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas
- Algorithms for new types of fair stable matchings
- From Marriages to Coalitions: A Soft CSP Approach
- Stable marriage with general preferences
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case
- On the approximability of the stable matching problem with ties of size two
- ``Sex-equal stable matchings
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- Sex-equal stable matchings: complexity and exact algorithms
This page was built for publication: Approximation Algorithms for the Sex-Equal Stable Marriage Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603527)