Cargando…
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
Stable matching problems with lower quotas are fundamental in academic hiring and ensuring operability of rural hospitals. Only few tractable (polynomial-time solvable) cases of stable matching with lower quotas have been identified; most such problems are [Formula: see text] -hard and also hard to...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7066313/ https://www.ncbi.nlm.nih.gov/pubmed/32214574 http://dx.doi.org/10.1007/s00453-019-00636-y |