Size versus stability in the marriage problem
type: Item
instance of: scholarly article
title: Size versus stability in the marriage problem
zbMATH Open document ID: 1190.90155
author: Péter Biró
author: David F. Manlove
author: Shubham Mittal
published in: Theoretical Computer Science
publication date: 2010-04-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 5693349
zbMATH Keywords: stable marriage problem
zbMATH Keywords: stable matching
zbMATH Keywords: blocking pair
zbMATH Keywords: blocking agent
zbMATH Keywords: inapproximability result
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.02.003
OpenAlex ID: W2175150243
cites work: Approximation and Online Algorithms
cites work: Instability of matchings in decentralized markets with various preference structures
cites work: College Admissions and the Stability of Marriage
cites work: Some remarks on the stable matching problem
cites work: Q3995616
cites work: The Hospitals/Residents Problem with Quota Lower Bounds
cites work: An improved approximation lower bound for finding almost stable maximum matchings
cites work: An efficient algorithm for the “stable roommates” problem
cites work: Q4252038
cites work: The Complexity of Counting Stable Marriages
cites work: The Stable Roommates Problem with Ties
cites work: On-line algorithms for weighted bipartite matching and stable marriages
cites work: Q4704591
cites work: Hard variants of stable marriage.
cites work: NP-complete stable matching problems
cites work: Pairwise kidney exchange
cites work: Kidney Exchange
DOI: 10.1016/J.TCS.2010.02.003
description: scientific article; zbMATH DE number 5693349