Improved approximation results for the stable marriage problem
From MaRDI portal
Publication:3580942
Recommendations
- Improved approximation of 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
(34)- Improved approximation of the stable marriage problem
- Approximating stable matchings with ties of bounded size
- The hospitals/residents problem with lower quotas
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
- Stable Matching with Uncertain Linear Preferences
- An improved approximation lower bound for finding almost stable maximum matchings
- Improved approximation bounds for the student-project allocation problem with preferences over projects
- Faster and simpler approximation of stable matchings
- Linear time local approximation algorithm for maximum stable marriage
- A tight approximation bound for the stable marriage problem with restricted ties
- Maximum locally stable matchings
- A \(1.875\)-approximation algorithm for the stable marriage problem
- Randomized approximation of the stable marriage problem
- Maximum stable matching with one-sided ties of bounded length
- Approximability results for stable marriage problems with ties.
- Stable matching with uncertain linear preferences
- Improved approximation bounds for the student-project allocation problem with preferences over projects
- Algorithm Theory - SWAT 2004
- Better and simpler approximation algorithms for the stable marriage problem
- Randomized approximation of the stable marriage problem
- A 3/2-Approximation Algorithm for General Stable Marriage
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- Envy-freeness and relaxed stability: hardness and approximation algorithms
- Local search approaches in stable matching problems
- Approximability of economic equilibrium for housing markets with duplicate houses
- Critical Relaxed Stable Matchings with Two-Sided Ties
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem
- Stable marriage with general preferences
- On the approximability of the stable matching problem with ties of size two
- Mathematical models for stable matching problems with ties and incomplete lists
- Cutoff stability under distributional constraints with an application to summer internship matching
- Review of the theory of stable matchings and contract systems
- Algorithms and Computation
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
This page was built for publication: Improved approximation results for the stable marriage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580942)
