scientific article; zbMATH DE number 6297782
From MaRDI portal
Publication:5417703
zbMath1288.05275MaRDI QIDQ5417703
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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) Matching models (91B68)
Related Items (22)
Strategyproof matching with regional minimum and maximum quotas ⋮ Blockers and antiblockers of stable matchings ⋮ Popularity in the generalized hospital residents setting ⋮ Strategy-proof school choice mechanisms with minimum quotas and initial endowments ⋮ Two problems in max-size popular matchings ⋮ Review of the theory of stable matchings and contract systems ⋮ Hedonic diversity games: a complexity picture with more than two colors ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas ⋮ Stable Matching with Proportionality Constraints ⋮ Assignment Mechanisms Under Distributional Constraints ⋮ Envy-free matchings with lower quotas ⋮ The stable \(b\)-matching polytope revisited ⋮ A Matroid Approach to Stable Matchings with Lower Quotas ⋮ Envy-freeness and relaxed stability: hardness and approximation algorithms ⋮ Stable matchings with covering constraints: a complete computational trichotomy ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Matroidal Choice Functions ⋮ Unnamed Item ⋮ The hospitals/residents problem with lower quotas
This page was built for publication:
