Every hospital-residents instance with sized agents admits an occupancy-stable matching, computable in linear time, but maximizing its size is NP-hard with a 3-approximation.
In: Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Stability Notions for Hospital Residents with Sizes
Every hospital-residents instance with sized agents admits an occupancy-stable matching, computable in linear time, but maximizing its size is NP-hard with a 3-approximation.