Stable matchings with covering constraints: a complete computational trichotomy

DOI10.1007/s00453-019-00636-yzbMath1433.91098WikidataQ90667599 ScholiaQ90667599MaRDI QIDQ2309466

Matthias Mnich, Ildikó Schlotter

Publication date: 1 April 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-019-00636-y

zbMATH Keywords

fixed-parameter algorithms; lower quotas; stable marriage

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

91B68: Matching models

68Q27: Parameterized complexity, tractability and kernelization