Local search approaches in stable matching problems
From MaRDI portal
Publication:1736586
DOI10.3390/A6040591zbMATH Open1461.05163OpenAlexW2047128428MaRDI QIDQ1736586FDOQ1736586
Toby Walsh, Kristen Brent Venable, Mirco Gelain, Maria Silvia Pini, Francesca Rossi
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a6040591
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Understanding the generalized median stable matchings
- Improved approximation results for the stable marriage problem
- Three Fast Algorithms for Four Problems in Stable Marriage
- College Admissions and the Stability of Marriage
- Size versus stability in the marriage problem
- Random Paths to Stability in Two-Sided Matching
- Algorithmics of Matching Under Preferences
- Finding large stable matchings
- Stable assignment with couples: parameterized complexity and local search
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- 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.
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- A 3/2-Approximation Algorithm for General Stable Marriage
- Approximability results for stable marriage problems with ties.
- Algorithm Theory - SWAT 2004
- Randomized Approximation of the Stable Marriage Problem
- Stability, optimality and manipulation in matching problems with weighted preferences
Cited In (6)
- A local interaction dynamic for the matching problem
- Editorial: Special issue on matching under preferences
- A surgical scheduling method considering surgeons' preferences
- Title not available (Why is that?)
- A Local Computation Approximation Scheme to Maximum Matching
- Stability, optimality and manipulation in matching problems with weighted preferences
This page was built for publication: Local search approaches in stable matching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736586)
