Better and simpler approximation algorithms for the stable marriage problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1405659 (Why is no real title available?)
- A 3/2-Approximation Algorithm for General Stable Marriage
- A \(1.875\)-approximation algorithm for the stable marriage problem
- Approximability results for stable marriage problems with ties.
- Approximation Algorithms for the Sex-Equal Stable Marriage Problem
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem
- College Admissions and the Stability of Marriage
- Finding large stable matchings
- Hard variants of stable marriage.
- Improved approximation results for the stable marriage problem
- Randomized approximation of the stable marriage problem
Cited in
(30)- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- A formal theory for the complexity class associated with the stable marriage problem
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem
- Critical Relaxed Stable Matchings with Two-Sided Ties
- An $\frac{8}{5}$ -Approximation Algorithm for a Hard Variant of Stable Marriage
- Application of pair approximation method to modeling and analysis of a marriage network
- Stable matchings, one-sided ties, and approximate popularity
- Improved approximation of the stable marriage problem
- On the approximability of the stable matching problem with ties of size two
- Efficient algorithms for generalized stable marriage and roommates problems
- A 3/2-Approximation Algorithm for General Stable Marriage
- Stable marriage with covering constraints -- a complete computational trichotomy
- Maximum stable matching with one-sided ties of bounded length
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization)
- Popular matchings with lower quotas
- Maximum locally stable matchings
- Local search approaches in stable matching problems
- Algorithms and Computation
- On the number of employed in the matching model
- Popularity vs maximum cardinality in the stable marriage setting
- Student-project allocation with preferences over projects: algorithmic and experimental results
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- Improved approximation bounds for the student-project allocation problem with preferences over projects
- scientific article; zbMATH DE number 7561396 (Why is no real title available?)
- Improved approximation bounds for the student-project allocation problem with preferences over projects
- Faster and simpler approximation of stable matchings
- Faster and simpler approximation of stable matchings
- Linear time local approximation algorithm for maximum stable marriage
- Improved approximation results for the stable marriage problem
This page was built for publication: Better and simpler approximation algorithms for the stable marriage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547284)
