25 search results - page 2 / 5 » Improved Approximation of the Stable Marriage Problem |
ALGORITHMICA
2010
13 years 4 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
ICALP
1999
Springer
13 years 9 months ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
ACID
2006
13 years 6 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
ICALP
1991
Springer
13 years 8 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
ICDCS
2009
IEEE
14 years 1 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...