Approximation algorithms for the sex-equal stable marriage problem

DOI10.1145/1868237.1868239zbMath1295.68216OpenAlexW2154426512MaRDI QIDQ3188983

Shuichi Miyazaki, Hiroki Yanagisawa, Kazuo Iwama

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/226949

zbMATH Keywords

approximation algorithmsstable marriage problemsex-equal stable marriage problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Matching models (91B68)

Related Items (5)

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) ⋮ Submodular reassignment problem for reallocating agents to tasks with synergy effects ⋮ Solving stable matching problems using answer set programming ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ Sex-equal stable matchings: complexity and exact algorithms

This page was built for publication: Approximation algorithms for the sex-equal stable marriage problem