Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2010
Springer
125views Education» more  CORR 2010»
10 years 2 months ago
Local search for stable marriage problems with ties and incomplete lists
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
10 years 2 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
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...
Dániel Marx, Ildikó Schlotter
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
10 years 8 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
IWPEC
2009
Springer
10 years 9 months ago
Improved Parameterized Algorithms for the Kemeny Aggregation Problem
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
Narges Simjour
books