Improved approximation of the stable marriage problem
From MaRDI portal
Recommendations
- Improved approximation results for the stable marriage problem
- Algorithms and Computation
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
- A 1.875-approximation algorithm for the stable marriage problem
- Better and simpler approximation algorithms for the stable marriage problem
Cited in
(19)- Stable marriage with ties and bounded length preference lists
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Approximability results for stable marriage problems with ties.
- Linear time local approximation algorithm for maximum stable marriage
- Randomized approximation of the stable marriage problem
- Approximating stable matchings with ties of bounded size
- A 1.875-approximation algorithm for the stable marriage problem
- scientific article; zbMATH DE number 2086256 (Why is no real title available?)
- Randomized approximation of the stable marriage problem
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem
- Improved approximation results for the stable marriage problem
- A 3/2-Approximation Algorithm for General Stable Marriage
- 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 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
- An improved approximation lower bound for finding almost stable maximum matchings
This page was built for publication: Improved approximation of the stable marriage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897252)
