scientific article; zbMATH DE number 1405659
From MaRDI portal
Publication:4938640
zbMath0948.90155MaRDI QIDQ4938640
Shuichi Miyazaki, David F. Manlove, Yasufumi Morita, Kazuo Iwama
Publication date: 23 February 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Approximation methods and heuristics in mathematical programming (90C59) Operations research and management science (90B99)
Related Items (33)
The structure of stable marriage with indifference ⋮ Satisfied two-sided matching: a method considering elation and disappointment of agents ⋮ Characterization of super-stable matchings ⋮ Randomized approximation of the stable marriage problem ⋮ Polynomial time algorithm for an optimal stable assignment with multiple partners ⋮ A branch-and-price algorithm for stable workforce assignments with hierarchical skills ⋮ Hardness and approximation results for some variants of stable marriage problem ⋮ Improved approximation algorithms for two variants of the stable marriage problem with ties ⋮ Pareto stability in two-sided many-to-many matching with weak preferences ⋮ On the number of employed in the matching model ⋮ The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences ⋮ Solving hard stable matching problems involving groups of similar agents ⋮ Parameterized complexity and local search approaches for the stable marriage problem with ties ⋮ Housing markets through graphs ⋮ Approximability results for stable marriage problems with ties. ⋮ Better and Simpler Approximation Algorithms for the Stable Marriage Problem ⋮ A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem ⋮ 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 ⋮ Stable fractional matchings ⋮ A 25/17-approximation algorithm for the stable marriage problem with one-sided ties ⋮ Better and simpler approximation algorithms for the stable marriage problem ⋮ Unnamed Item ⋮ 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 ⋮ Stable multi-skill workforce assignments ⋮ Stable marriage with ties and bounded length preference lists ⋮ A New Approach to the Pareto Stable Matching Problem ⋮ The stable marriage problem with ties and restricted edges ⋮ Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters ⋮ Hard variants of stable marriage.
This page was built for publication:
