Publication:4938640
From MaRDI portal
zbMath0948.90155MaRDI QIDQ4938640
Kazuo Iwama, Shuichi Miyazaki, David F. Manlove, Yasufumi Morita
Publication date: 23 February 2000
68Q25: Analysis of algorithms and problem complexity
05A05: Permutations, words, matrices
90C59: Approximation methods and heuristics in mathematical programming
90B99: Operations research and management science
Related Items
A New Approach to the Pareto Stable Matching Problem, On the complexity of exchange-stable roommates, A branch-and-price algorithm for stable workforce assignments with hierarchical skills, A 25/17-approximation algorithm for the stable marriage problem with one-sided ties, Better and simpler approximation algorithms for the stable marriage problem, The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences, Stable multi-skill workforce assignments, Improved approximation algorithms for two variants of the stable marriage problem with ties, A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem, Stable marriage with ties and bounded length preference lists, Approximability results for stable marriage problems with ties., Hard variants of stable marriage., The structure of stable marriage with indifference, Randomized approximation of the stable marriage problem, Parameterized complexity and local search approaches for the stable marriage problem with ties, Housing markets through graphs, Polynomial time algorithm for an optimal stable assignment with multiple partners, Better and Simpler Approximation Algorithms for the Stable Marriage Problem
