scientific article
From MaRDI portal
Publication:3044355
zbMath1059.68578MaRDI QIDQ3044355
Yasufumi Morita, Magnús M. Halldórsson, Shuichi Miyazaki, 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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Related Items
Randomized approximation of the stable marriage problem, Approximability results for stable marriage problems with ties., On the complexity of distributed stable matching with small messages, Stable marriage with ties and bounded length preference lists