Linear time local approximation algorithm for maximum stable marriage
From MaRDI portal
Recommendations
- Better and simpler approximation algorithms for the stable marriage problem
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem
- A 3/2-Approximation Algorithm for General Stable Marriage
- Faster and simpler approximation of stable matchings
- Improved approximation of the stable marriage problem
Cites work
- scientific article; zbMATH DE number 45086 (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
- 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
- Better and simpler approximation algorithms for the stable marriage problem
- College Admissions and the Stability of Marriage
- Faster and simpler approximation of stable matchings
- Finding large stable matchings
- Hard variants of stable marriage.
- Improved approximation results for the stable marriage problem
- Linear time local approximation algorithm for maximum stable marriage
- Randomized approximation of the stable marriage problem
- Storing a Sparse Table with 0 (1) Worst Case Access Time
Cited in
(16)- On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization)
- Hardness and approximation results for some variants of stable marriage problem
- Characterization of super-stable matchings
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- Linear time local approximation algorithm for maximum stable marriage
- Maximum locally stable matchings
- Maximum stable matching with one-sided ties of bounded length
- Editorial: Special issue on matching under preferences
- A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- Almost stable matchings by truncating the Gale-Shapley algorithm
- Local search approaches in stable matching problems
- Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas
- Critical Relaxed Stable Matchings with Two-Sided Ties
- On the approximability of the stable matching problem with ties of size two
- Mathematical models for stable matching problems with ties and incomplete lists
This page was built for publication: Linear time local approximation algorithm for maximum stable marriage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736578)
