Counting Popular Matchings in House Allocation Problems
From MaRDI portal
Publication:4981147
DOI10.1007/978-3-319-06686-8_4zbMath1407.68342arXiv1312.3552OpenAlexW1501677826MaRDI QIDQ4981147
Nitesh Jha, Rupam Acharyya, Sourav Chakraborty
Publication date: 24 June 2014
Published in: Computer Science - Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.3552
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Matching models (91B68)
Related Items