26 search results - page 1 / 6 » Better and Simpler Approximation Algorithms for the Stable M... |
ESA
2008
Springer
13 years 6 months ago
2008
Springer
WADS
2007
Springer
13 years 11 months ago
2007
Springer
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
JCO
2008
13 years 4 months ago
2008
ESA
2003
Springer
13 years 10 months ago
2003
Springer
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 ...
COCOON
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...