Publication:4938640
From MaRDI portal
zbMath0948.90155MaRDI QIDQ4938640
Shuichi Miyazaki, David F. Manlove, Yasufumi Morita, Kazuo Iwama
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
Unnamed Item, A New Approach to the Pareto Stable Matching Problem, On the complexity of exchange-stable roommates, Maximum stable matching with one-sided ties of bounded length, Super-stability in the student-project allocation problem with ties, Hardness and approximation results for some variants of stable marriage problem, 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, The stable marriage problem with ties and restricted edges, Characterization of super-stable matchings, 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, Satisfied two-sided matching: a method considering elation and disappointment of agents, Linear time local approximation algorithm for maximum stable marriage, Local search approaches in stable matching problems, Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists, Randomized approximation of the stable marriage problem, Parameterized complexity and local search approaches for the stable marriage problem with ties, Housing markets through graphs, Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters, Solving hard stable matching problems involving groups of similar agents, Stable fractional matchings, Polynomial time algorithm for an optimal stable assignment with multiple partners, Pareto stability in two-sided many-to-many matching with weak preferences, On the number of employed in the matching model, Better and Simpler Approximation Algorithms for the Stable Marriage Problem
