Complexity of the sex-equal stable marriage problem
From MaRDI portal
(Redirected from Publication:689901)
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- Characterization of stable matchings as extreme points of a polytope
- College Admissions and the Stability of Marriage
- Every finite distributive lattice is a set of stable matchings
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
- Linear programming brings marital bliss
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
Cited in
(18)- A formal theory for the complexity class associated with the stable marriage problem
- Constrained stable marriage with free edges or few blocking pairs
- Approximability results for stable marriage problems with ties.
- The complexity of the certification of properties of stable marriage
- Approximation Algorithms for the Sex-Equal Stable Marriage Problem
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- NP-complete stable matching problems
- On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization)
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case
- Balanced stable marriage: how close is close enough?
- Hardness results on the man-exchange stable marriage problem with short preference lists
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
- Sex-equal stable matchings: complexity and exact algorithms
- Stable fractional matchings
- The Complexity of Counting Stable Marriages
- On a many-sided matching problem with mixed preferences
- Approximation algorithms for the sex-equal stable marriage problem
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)
