A 1.875-approximation algorithm for the stable marriage problem
From MaRDI portal
A \(1.875\)-approximation algorithm for the stable marriage problem
Recommendations
Cited in
(23)- Stable marriage with ties and bounded length preference lists
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Linear time local approximation algorithm for maximum stable marriage
- Local search approaches in stable matching problems
- Faster and simpler approximation of stable matchings
- On the approximability of the stable matching problem with ties of size two
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Pareto stability in two-sided many-to-many matching with weak preferences
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem
- Improved approximation results for the stable marriage problem
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- An $\frac{8}{5}$ -Approximation Algorithm for a Hard Variant of Stable Marriage
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- Algorithm Theory - SWAT 2004
- A tight approximation bound for the stable marriage problem with restricted ties
- An improved approximation algorithm for the stable marriage problem with one-sided ties
- Better and simpler approximation algorithms for the stable marriage problem
- Improved approximation of the stable marriage problem
- Algorithms and Computation
- Maximum stable matching with one-sided ties of bounded length
- Stable matchings, one-sided ties, and approximate popularity
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
This page was built for publication: A \(1.875\)-approximation algorithm for the stable marriage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934607)
