Faster and simpler approximation of stable matchings
From MaRDI portal
Publication:1736612
DOI10.3390/A7020189zbMATH Open1461.68259OpenAlexW2019340823MaRDI QIDQ1736612FDOQ1736612
Authors: Katarzyna Paluch 
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a7020189
Recommendations
- Faster and simpler approximation of stable matchings
- Fast distributed almost stable matchings
- Improved approximation algorithms for stochastic matching
- An improved approximation lower bound for finding almost stable maximum matchings
- A faster algorithm for the Strongly Stable \(b\)-Matching Problem
- Improving solution times for stable matching problems through preprocessing
- Better and simpler approximation algorithms for the stable marriage problem
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem
- A New Approach to Stable Matching Problems
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Matching models (91B68)
Cites Work
- Matching theory
- Improved approximation results for the stable marriage problem
- College Admissions and the Stability of Marriage
- Finding large stable matchings
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- Better and simpler approximation algorithms for the stable marriage problem
- Hard variants of stable marriage.
- Approximation Algorithms for the Sex-Equal Stable Marriage Problem
- A 3/2-Approximation Algorithm for General Stable Marriage
- Title not available (Why is that?)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
- Approximability results for stable marriage problems with ties.
- Faster and simpler approximation of stable matchings
Cited In (24)
- The Complexity of Approximately Counting Stable Matchings
- Hardness and approximation results for some variants of stable marriage problem
- Improving man-optimal stable matchings by minimum change of preference lists
- Subquadratic algorithms for succinct stable matching
- Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings
- Characterization of super-stable matchings
- Stochastic Matching with Few Queries: New Algorithms and Tools
- Collapsing Superstring Conjecture
- Title not available (Why is that?)
- Maximum stable matching with one-sided ties of bounded length
- An algorithm to compute the full set of many-to-many stable matchings.
- The complexity of approximately counting stable matchings
- Finding a minimum-regret many-to-many Stable Matching
- Fast distributed almost stable matchings
- Disjoint stable matchings in linear time
- Almost stable matchings by truncating the Gale-Shapley algorithm
- Faster and simpler approximation of stable matchings
- Critical Relaxed Stable Matchings with Two-Sided Ties
- Faster algorithm for finding maximum 1-restricted simple 2-matchings
- Faster algorithms for stable allocation problems
- On the approximability of the stable matching problem with ties of size two
- Title not available (Why is that?)
- Parameterized algorithms for stable matching with ties and incomplete lists
- Mathematical models for stable matching problems with ties and incomplete lists
This page was built for publication: Faster and simpler approximation of stable matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736612)
