The Complexity of Approximately Counting Stable Matchings
type: Item
instance of: scholarly article
title: The Complexity of Approximately Counting Stable Matchings
zbMATH Open document ID: 1304.68069
DOI: 10.1007/978-3-642-15369-3_7
author: Prasad Chebolu
author: Leslie Ann Goldberg
author: Russell Martin
published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
publication date: 2010-09-10T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 5783889
MaRDI profile type: Publication
full work available at URL: 978-3-642-15369-3 7
OpenAlex ID: W4245535511
Recommended article: The complexity of approximately counting stable matchings
Recommended article: Approximating stable matchings with ties of bounded size
Recommended article: A simply exponential upper bound on the maximum number of stable matchings
Recommended article: Faster and Simpler Approximation of Stable Matchings
Recommended article: Faster and simpler approximation of stable matchings
Recommended article: On the approximability of the stable matching problem with ties of size two
Recommended article: The computational strength of matchings in countable graphs
Recommended article: Algorithms and complexity of strongly stable non-crossing matchings
Recommended article: An improved approximation lower bound for finding almost stable maximum matchings
description: scientific article