Popular Matchings with Variable Job Capacities
From MaRDI portal
Publication:3652230
DOI10.1007/978-3-642-10631-6_44zbMath1273.68149DBLPconf/isaac/KavithaN09OpenAlexW2123346WikidataQ62045788 ScholiaQ62045788MaRDI QIDQ3652230
Telikepalli Kavitha, Meghana Nasre
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_44
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Related Items (4)
The Complexity of Computing the Random Priority Allocation Matrix ⋮ Popular matchings with variable item copies ⋮ Bounded unpopularity matchings ⋮ Maximum locally stable matchings
This page was built for publication: Popular Matchings with Variable Job Capacities
