Parameterized complexity and local search approaches for the stable marriage problem with ties

DOI10.1007/s00453-009-9326-zzbMath1204.68148MaRDI QIDQ1959726

Dániel Marx, Ildikó Schlotter

Publication date: 7 October 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9326-z

zbMATH Keywords

local search; parameterized complexity; stable marriage with ties

Mathematics Subject Classification ID

68R05: Combinatorics in computer science

05A05: Permutations, words, matrices

68R10: Graph theory (including graph drawing) in computer science