scientific article; zbMATH DE number 2086256

zbMATH Open1059.68578MaRDI QIDQ3044355FDOQ3044355

Authors: Magnús M. Halldórsson, Shuichi Miyazaki, Yasufumi Morita, Kazuo Iwama 

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2286/22860554.htm

Title of this publication is not available (Why is that?)

Recommendations

• Hard variants of stable marriage.
• Approximability results for stable marriage problems with ties.
• Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
• scientific article; zbMATH DE number 1405659
• Improved approximation of the stable marriage problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)

Cited In (14)

• Comment on worst-case choice for the stable marriage problem
• Complexity of the sex-equal stable marriage problem
• Stable marriage with ties and bounded length preference lists
• Hardness results on the man-exchange stable marriage problem with short preference lists
• The stable marriage problem with master preference lists
• Size versus stability in the marriage problem
• Randomized approximation of the stable marriage problem
• Approximability results for stable marriage problems with ties.
• Size Versus Stability in the Marriage Problem
• Hard variants of stable marriage.
• A nonconstructive elementary proof of the existence of stable marriages
• Parameterized complexity and local search approaches for the stable marriage problem with ties
• Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
• On the complexity of distributed stable matching with small messages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044355)