Improved approximation algorithms for two variants of the stable marriage problem with ties
From MaRDI portal
(Redirected from Publication:896290)
Recommendations
- An improved approximation algorithm for the stable marriage problem with one-sided ties
- Improved approximation of the stable marriage problem
- A \(1.875\)-approximation algorithm for the stable marriage problem
- Improved approximation results for the stable marriage problem
- Better and simpler approximation algorithms for the stable marriage problem
Cites work
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 1342147 (Why is no real title available?)
- scientific article; zbMATH DE number 477584 (Why is no real title available?)
- scientific article; zbMATH DE number 1405659 (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.875\)-approximation algorithm for the stable marriage problem
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- 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
- Faster and simpler approximation of stable matchings
- Hard variants of stable marriage.
- Improved approximation results for the stable marriage problem
- Linear programming brings marital bliss
- Linear time local approximation algorithm for maximum stable marriage
- Randomized approximation of the stable marriage problem
- Socially stable matchings in the hospitals/residents problem
- Some remarks on the stable matching problem
- Stable marriage and indifference
Cited in
(8)- Critical Relaxed Stable Matchings with Two-Sided Ties
- Stable matchings, one-sided ties, and approximate popularity
- Three-sided matching problem with mixed preferences
- On the approximability of the stable matching problem with ties of size two
- Maximum stable matching with one-sided ties of bounded length
- On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization)
- Algorithms and Computation
- An improved approximation algorithm for the stable marriage problem with one-sided ties
This page was built for publication: Improved approximation algorithms for two variants of the stable marriage problem with ties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896290)
