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
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
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized approximation of the stable marriage problem
Theoretical Computer Science - Special papers from: COCOON 2003
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Pareto optimality in house allocation problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ACM Transactions on Algorithms (TALG)
Better and Simpler Approximation Algorithms for the Stable Marriage Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Stable marriage with ties and bounded length preference lists
Journal of 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
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
Communication requirements for stable marriages
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Faster and simpler approximation of stable matchings
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An 8/5-approximation algorithm for a hard variant of stable marriage
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
We consider the problem of finding a stable matching of maximum size when both ties and unacceptable partners are allowed in preference lists. This problem is known to be APX-hard, and the current best known approximation algorithm achieves the approximation ratio 2-c 1/√N, where c is some positive constant. In this paper, we give a 1.875-approximation algorithm, which is the first result on the approximation ratio better than two.