The Hospitals/Residents Problem with Quota Lower Bounds

DOI10.1007/978-3-642-23719-5_16zbMath1331.68090OpenAlexW16941573MaRDI QIDQ3092227

Koki Hamada, Shuichi Miyazaki, Kazuo Iwama

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/226951

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Matching models (91B68)

Related Items (9)

``Almost stable matchings in the roommates problem with bounded preference lists ⋮ Matching with quorums ⋮ A note on the serial dictatorship with project closures ⋮ Envy-free matchings with lower quotas ⋮ Size versus stability in the marriage problem ⋮ Balanced stable marriage: how close is close enough? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The hospitals/residents problem with lower quotas

This page was built for publication: The Hospitals/Residents Problem with Quota Lower Bounds