Hard variants of stable marriage.
type: Item
instance of: scholarly article
title: Hard variants of stable marriage.
zbMATH Open document ID: 1050.68171
DOI: 10.1016/S0304-3975(01)00206-7
author: David F. Manlove
author: Robert W. Irving
author: Kazuo Iwama
author: Shuichi Miyazaki
author: Yasufumi Morita
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 1768183
zbMATH Keywords: Stable marriage problem
zbMATH Keywords: Indifference
zbMATH Keywords: Ties
zbMATH Keywords: NP-completeness
zbMATH Keywords: Approximation algorithms
MaRDI profile type: Publication
cites work: A new fixed point approach for stable networks and stable marriages
cites work: College Admissions and the Stability of Marriage
cites work: Some remarks on the stable matching problem
cites work: Three Fast Algorithms for Four Problems in Stable Marriage
cites work: Q3995616
cites work: Minimum Edge Dominating Sets
cites work: An efficient algorithm for the “stable roommates” problem
cites work: Stable marriage and indifference
cites work: Q4252038
cites work: Q2721985
cites work: Q4938640
cites work: NP-complete stable matching problems
cites work: Q3999327
cites work: Edge Dominating Sets in Graphs
full work available at URL: s0304-3975(01)00206-7
OpenAlex ID: W2059209074
description: scientific article; zbMATH DE number 1768183