Critical Relaxed Stable Matchings with Two-Sided Ties
From MaRDI portal
Publication:6496558
Cites work
- scientific article; zbMATH DE number 7650242 (Why is no real title available?)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- A 3/2-Approximation Algorithm for General Stable Marriage
- A \((1 + 1/e)\)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists
- Better and simpler approximation algorithms for the stable marriage problem
- College Admissions and the Stability of Marriage
- Envy-free matchings with lower quotas
- Envy-freeness and relaxed stability: hardness and approximation algorithms
- Envy-freeness and relaxed stability: hardness and approximation algorithms
- Faster and simpler approximation of stable matchings
- Hard variants of stable marriage.
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- Improved approximation results for the stable marriage problem
- Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas
- Linear time local approximation algorithm for maximum stable marriage
- Popular matchings in the marriage and roommates problems
- Popular matchings with lower quotas
- Stability and Polarization of Interests in Job Matching
- The hospitals/residents problem with lower quotas
This page was built for publication: Critical Relaxed Stable Matchings with Two-Sided Ties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496558)
