The stable marriage problem with ties and restricted edges
From MaRDI portal
Publication:783028
DOI10.1016/j.disopt.2020.100571zbMath1506.91117arXiv1907.10458OpenAlexW3010061830MaRDI QIDQ783028
Publication date: 30 July 2020
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.10458
Related Items (4)
Constrained stable marriage with free edges or few blocking pairs ⋮ Computing relaxations for the three-dimensional stable matching problem with cyclic preferences ⋮ Bribery and Control in Stable Marriage ⋮ Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- College admissions with stable score-limits
- An algorithm for a super-stable roommates problem
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Efficient algorithms for generalized stable marriage and roommates problems
- Stable marriage with ties and bounded length preference lists
- Two-sided matching with incomplete information about others' preferences
- Stable marriage and indifference
- The stable marriage problem with restricted pairs.
- Hard variants of stable marriage.
- The structure of stable marriage with indifference
- Mathematical models for stable matching problems with ties and incomplete lists
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- XSAT and NAE-SAT of linear CNF classes
- Socially Stable Matchings in the Hospitals/Residents Problem
- Algorithmics of Matching Under Preferences
- The complexity of satisfiability problems
- College Admissions and the Stability of Marriage
This page was built for publication: The stable marriage problem with ties and restricted edges
