Complexity of the sex-equal stable marriage problem
From MaRDI portal
Publication:689901
DOI10.1007/BF03167200zbMATH Open0782.68060MaRDI QIDQ689901FDOQ689901
Authors: Akiko Kato 
Publication date: 13 March 1994
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Recommendations
Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- Every finite distributive lattice is a set of stable matchings
- Linear programming brings marital bliss
- Characterization of stable matchings as extreme points of a polytope
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
Cited In (17)
- The complexity of the certification of properties of stable marriage
- Stable fractional matchings
- Hardness results on the man-exchange stable marriage problem with short preference lists
- Approximability results for stable marriage problems with ties.
- A formal theory for the complexity class associated with the stable marriage problem
- Constrained stable marriage with free edges or few blocking pairs
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
- Approximation Algorithms for the Sex-Equal Stable Marriage Problem
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)
- NP-complete stable matching problems
- Balanced stable marriage: how close is close enough?
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- The Complexity of Counting Stable Marriages
- On a many-sided matching problem with mixed preferences
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case
- Sex-equal stable matchings: complexity and exact algorithms
This page was built for publication: Complexity of the sex-equal stable marriage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689901)
