The Complexity of Approximately Counting Stable Matchings
From MaRDI portal
Publication:3588401
DOI10.1007/978-3-642-15369-3_7zbMath1304.68069OpenAlexW4245535511MaRDI QIDQ3588401
Russell Martin, Leslie Ann Goldberg, Prasad Chebolu
Publication date: 10 September 2010
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_7
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Related Items (3)
Subquadratic algorithms for succinct stable matching ⋮ The complexity of approximately counting stable roommate assignments ⋮ Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices
This page was built for publication: The Complexity of Approximately Counting Stable Matchings
