The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Stable marriage and indifference
CO89 Selected papers of the conference on Combinatorial Optimization
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the complexity of exchange-stable roommates
Discrete Applied Mathematics
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hard variants of stable marriage
Theoretical Computer Science
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Strong Stability in the Hospitals/Residents Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
A fixed-point approach to stable matchings and some applications
Mathematics of Operations Research
Approximability results for stable marriage problems with ties
Theoretical Computer Science
Randomized approximation of the stable marriage problem
Theoretical Computer Science - Special papers from: COCOON 2003
Stable marriages with multiple partners: efficient search for an optimal solution
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A (2 - c1/√N)-approximation algorithm for the stable marriage problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Better and Simpler Approximation Algorithms for the Stable Marriage Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A 3/2-Approximation Algorithm for General Stable Marriage
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
An improved algorithm for multi-way trading for exchange and barter
Electronic Commerce Research and Applications
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Communication requirements for stable marriages
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Approximability of economic equilibrium for housing markets with duplicate houses
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Journal of Discrete Algorithms
Faster and simpler approximation of stable matchings
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum size, while any stable matching is a maximal matching and thus trivially we can obtain a 2-approximation algorithm. In this article, we give the first nontrivial result for approximation of factor less than two. Our algorithm achieves an approximation ratio of 2/(1 + L−2) for instances in which only men have ties of length at most L. When both men and women are allowed to have ties but the lengths are limited to two, then we show a ratio of 13/7(1.1052).