Approximability results for stable marriage problems with ties.
type: Item
instance of: scholarly article
title: Approximability results for stable marriage problems with ties.
zbMATH Open document ID: 1060.68085
DOI: 10.1016/S0304-3975(03)00321-9
author: Magnús M. Halldórsson
author: Robert W. Irving
author: Kazuo Iwama
author: David F. Manlove
author: Shuichi Miyazaki
author: Yasufumi Morita
author: Sandy Scott
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2056809
zbMATH Keywords: Stable marriage problem
zbMATH Keywords: Ties
zbMATH Keywords: Unacceptable partners
zbMATH Keywords: Inapproximability results
zbMATH Keywords: Approximation algorithm
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: Q4198056
cites work: Three Fast Algorithms for Four Problems in Stable Marriage
cites work: Q3995616
cites work: Q3044355
cites work: Minimum Edge Dominating Sets
cites work: Stable marriage and indifference
cites work: Q4252038
cites work: Q2721985
cites work: Q4938640
cites work: Complexity of the sex-equal stable marriage problem
cites work: Hard variants of stable marriage.
cites work: NP-complete stable matching problems
cites work: Q3999327
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Greedy approximations of independent sets in low degree graphs
full work available at URL: s0304-3975(03)00321-9
OpenAlex ID: W2133312780
description: scientific article; zbMATH DE number 2056809