A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
Hard variants of stable marriage
Theoretical Computer Science
Faster approximation algorithms for the minimum latency problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximability results for stable marriage problems with ties
Theoretical Computer Science
Improved approximation results for the stable marriage problem
ACM Transactions on Algorithms (TALG)
A 1.875: approximation algorithm for the stable marriage problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding large stable matchings
Journal of Experimental Algorithmics (JEA)
A 3/2-Approximation Algorithm for General Stable Marriage
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Better and Simpler Approximation Algorithms for the Stable Marriage Problem
Algorithmica - Special Issue: European Symposium on Algorithms
A (2 - c1/√N)-approximation algorithm for the stable marriage problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We give a 3/2-approximation algorithm for stable matchings that runs in O(m) time. The previously best known algorithm by McDermid has the same approximation ratio but runs in O(n3/2m) time, where n denotes the number of people and m is the total length of the preference lists in a given instance. Also the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.