Near-Popular Matchings in the Roommates Problem

DOI10.1007/978-3-642-23719-5_15zbMath1346.05232MaRDI QIDQ3092226

Telikepalli Kavitha, Chien-Chung Huang

Publication date: 16 September 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_15

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

91B68: Matching models

Related Items

Unpopularity factor in the marriage and roommates problems